skip to main content

Title: Factorization problems in complex reflection groups
We enumerate factorizations of a Coxeter element into arbitrary factors in the complex reflection groups G(d, 1, n) (the wreath product of the symmetric group with a cyclic group) and its subgroup G(d, d, n), applying combinatorial and algebraic methods, respectively. After a change of basis, the coefficients that appear are the same as those that appear in the corresponding enumeration in the symmetric group.
Authors:
;
Award ID(s):
1855536
Publication Date:
NSF-PAR ID:
10172347
Journal Name:
Séminaire lotharingien de combinatoire
Issue:
82B
Page Range or eLocation-ID:
#57
ISSN:
1286-4889
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract Consider the algebraic function $\Phi _{g,n}$ that assigns to a general $g$ -dimensional abelian variety an $n$ -torsion point. A question first posed by Klein asks: What is the minimal $d$ such that, after a rational change of variables, the function $\Phi _{g,n}$ can be written as an algebraic function of $d$ variables? Using techniques from the deformation theory of $p$ -divisible groups and finite flat group schemes, we answer this question by computing the essential dimension and $p$ -dimension of congruence covers of the moduli space of principally polarized abelian varieties. We apply this result to compute themore »essential $p$ -dimension of congruence covers of the moduli space of genus $g$ curves, as well as its hyperelliptic locus, and of certain locally symmetric varieties. These results include cases where the locally symmetric variety $M$ is proper . As far as we know, these are the first examples of nontrivial lower bounds on the essential dimension of an unramified, nonabelian covering of a proper algebraic variety.« less
  2. Abstract The duality principle for group representations developed in Dutkay et al. (J Funct Anal 257:1133–1143, 2009), Han and Larson (Bull Lond Math Soc 40:685–695, 2008) exhibits a fact that the well-known duality principle in Gabor analysis is not an isolated incident but a more general phenomenon residing in the context of group representation theory. There are two other well-known fundamental properties in Gabor analysis: the biorthogonality and the fundamental identity of Gabor analysis. The main purpose of this this paper is to show that these two fundamental properties remain to be true for general projective unitary group representations. Moreover,more »we also present a general duality theorem which shows that that muti-frame generators meet super-frame generators through a dual commutant pair of group representations. Applying it to the Gabor representations, we obtain that $$\{\pi _{\Lambda }(m, n)g_{1} \oplus \cdots \oplus \pi _{\Lambda }(m, n)g_{k}\}_{m, n \in {\mathbb {Z}}^{d}}$$ { π Λ ( m , n ) g 1 ⊕ ⋯ ⊕ π Λ ( m , n ) g k } m , n ∈ Z d is a frame for $$L^{2}({\mathbb {R}}\,^{d})\oplus \cdots \oplus L^{2}({\mathbb {R}}\,^{d})$$ L 2 ( R d ) ⊕ ⋯ ⊕ L 2 ( R d ) if and only if $$\cup _{i=1}^{k}\{\pi _{\Lambda ^{o}}(m, n)g_{i}\}_{m, n\in {\mathbb {Z}}^{d}}$$ ∪ i = 1 k { π Λ o ( m , n ) g i } m , n ∈ Z d is a Riesz sequence, and $$\cup _{i=1}^{k} \{\pi _{\Lambda }(m, n)g_{i}\}_{m, n\in {\mathbb {Z}}^{d}}$$ ∪ i = 1 k { π Λ ( m , n ) g i } m , n ∈ Z d is a frame for $$L^{2}({\mathbb {R}}\,^{d})$$ L 2 ( R d ) if and only if $$\{\pi _{\Lambda ^{o}}(m, n)g_{1} \oplus \cdots \oplus \pi _{\Lambda ^{o}}(m, n)g_{k}\}_{m, n \in {\mathbb {Z}}^{d}}$$ { π Λ o ( m , n ) g 1 ⊕ ⋯ ⊕ π Λ o ( m , n ) g k } m , n ∈ Z d is a Riesz sequence, where $$\pi _{\Lambda }$$ π Λ and $$\pi _{\Lambda ^{o}}$$ π Λ o is a pair of Gabor representations restricted to a time–frequency lattice $$\Lambda $$ Λ and its adjoint lattice $$\Lambda ^{o}$$ Λ o in $${\mathbb {R}}\,^{d}\times {\mathbb {R}}\,^{d}$$ R d × R d .« less
  3. Braverman, Mark (Ed.)
    For an abelian group H acting on the set [𝓁], an (H,𝓁)-lift of a graph G₀ is a graph obtained by replacing each vertex by 𝓁 copies, and each edge by a matching corresponding to the action of an element of H. Expanding graphs obtained via abelian lifts, form a key ingredient in the recent breakthrough constructions of quantum LDPC codes, (implicitly) in the fiber bundle codes by Hastings, Haah and O'Donnell [STOC 2021] achieving distance Ω̃(N^{3/5}), and in those by Panteleev and Kalachev [IEEE Trans. Inf. Theory 2021] of distance Ω(N/log(N)). However, both these constructions are non-explicit. In particular,more »the latter relies on a randomized construction of expander graphs via abelian lifts by Agarwal et al. [SIAM J. Discrete Math 2019]. In this work, we show the following explicit constructions of expanders obtained via abelian lifts. For every (transitive) abelian group H ⩽ Sym(𝓁), constant degree d ≥ 3 and ε > 0, we construct explicit d-regular expander graphs G obtained from an (H,𝓁)-lift of a (suitable) base n-vertex expander G₀ with the following parameters: ii) λ(G) ≤ 2√{d-1} + ε, for any lift size 𝓁 ≤ 2^{n^{δ}} where δ = δ(d,ε), iii) λ(G) ≤ ε ⋅ d, for any lift size 𝓁 ≤ 2^{n^{δ₀}} for a fixed δ₀ > 0, when d ≥ d₀(ε), or iv) λ(G) ≤ Õ(√d), for lift size "exactly" 𝓁 = 2^{Θ(n)}. As corollaries, we obtain explicit quantum lifted product codes of Panteleev and Kalachev of almost linear distance (and also in a wide range of parameters) and explicit classical quasi-cyclic LDPC codes with wide range of circulant sizes. Items (i) and (ii) above are obtained by extending the techniques of Mohanty, O'Donnell and Paredes [STOC 2020] for 2-lifts to much larger abelian lift sizes (as a byproduct simplifying their construction). This is done by providing a new encoding of special walks arising in the trace power method, carefully "compressing" depth-first search traversals. Result (iii) is via a simpler proof of Agarwal et al. [SIAM J. Discrete Math 2019] at the expense of polylog factors in the expansion.« less
  4. A bstract We compute 1 /λ corrections to the four-point functions of half-BPS operators in SU( N ) $$ \mathcal{N} $$ N = 4 super-Yang-Mills theory at large N and large ’t Hooft coupling λ = $$ {g}_{\mathrm{YM}}^2N $$ g YM 2 N using two methods. Firstly, we relate integrals of these correlators to derivatives of the mass deformed S 4 free energy, which was computed at leading order in large N and to all orders in 1 /λ using supersymmetric localization. Secondly, we use AdS/CFT to relate these 1 /λ corrections to higher derivative corrections to supergravity for scatteringmore »amplitudes of Kaluza-Klein scalars in IIB string theory on AdS 5 × S 5 , which in the flat space limit are known from worldsheet calculations. These two methods match at the order corresponding to the tree level R 4 interaction in string theory, which provides a precise check of AdS/CFT beyond supergravity, and allow us to derive the holographic correlators to tree level D 4 R 4 order. Combined with constraints from [1], our results can be used to derive CFT data to one-loop D 4 R 4 order. Finally, we use AdS/CFT to fix these correlators in the limit where N is taken to be large while g YM is kept fixed. In this limit, we present a conjecture for the small mass limit of the S 4 partition function that includes all instanton corrections and is written in terms of the same Eisenstein series that appear in the study of string theory scattering amplitudes.« less
  5. The codewords of the homomorphism code aHom(G,H) are the affine homomorphisms between two finite groups, G and H, generalizing Hadamard codes. Following the work of Goldreich-Levin (1989), Grigorescu et al. (2006), Dinur et al. (2008), and Guo and Sudan (2014), we further expand the range of groups for which local list-decoding is possible up to mindist, the minimum distance of the code. In particular, for the first time, we do not require either G or H to be solvable. Specifically, we demonstrate a poly(1/epsilon) bound on the list size, i. e., on the number of codewords within distance (mindist-epsilon) frommore »any received word, when G is either abelian or an alternating group, and H is an arbitrary (finite or infinite) group. We conjecture that a similar bound holds for all finite simple groups as domains; the alternating groups serve as the first test case. The abelian vs. arbitrary result permits us to adapt previous techniques to obtain efficient local list-decoding for this case. We also obtain efficient local list-decoding for the permutation representations of alternating groups (the codomain is a symmetric group) under the restriction that the domain G=A_n is paired with codomain H=S_m satisfying m < 2^{n-1}/sqrt{n}. The limitations on the codomain in the latter case arise from severe technical difficulties stemming from the need to solve the homomorphism extension (HomExt) problem in certain cases; these are addressed in a separate paper (Wuu 2018). We introduce an intermediate "semi-algorithmic" model we call Certificate List-Decoding that bypasses the HomExt bottleneck and works in the alternating vs. arbitrary setting. A certificate list-decoder produces partial homomorphisms that uniquely extend to the homomorphisms in the list. A homomorphism extender applied to a list of certificates yields the desired list.« less