English
Related papers

Related papers: Explicit Abelian Lifts and Quantum LDPC Codes

200 papers

Let $G$ be a Lie group, $H$ a closed subgroup and $M$ the homogeneous space $G/H$. Each representation $\Psi$ of $H$ determines a $G$-equivariant principal bundle ${\mathcal P}$ on $M$ endowed with a $G$-invariant connection. We consider…

Symplectic Geometry · Mathematics 2013-04-30 Andrés Viña

In this paper we study non-abelian extensions of a Lie group $G$ modeled on a locally convex space by a Lie group $N$. The equivalence classes of such extension are grouped into those corresponding to a class of so-called smooth outer…

Group Theory · Mathematics 2007-05-23 Karl-Hermann Neeb

The enhanced power graph $\mathcal G_e(\mathbf G)$ of a group $\mathbf G$ is the graph with vertex set $G$ such that two vertices $x$ and $y$ are adjacent if they are contained in a same cyclic subgroup. We prove that finite groups with…

Combinatorics · Mathematics 2018-10-18 Samir Zahirović , Ivica Bošnjak , Rozália Madarász

We present a symmetric LDPC code with constant rate and constant distance (i.e. good LDPC code) that its constraint space is generated by the orbit of one constant weight constraint under a group action. Our construction provides the first…

Information Theory · Computer Science 2011-08-16 Tali Kaufman , Alexander Lubotzky

We consider families of symmetric linear programs (LPs) that decide a property of graphs (or other relational structures) in the sense that, for each size of graph, there is an LP defining a polyhedral lift that separates the integer points…

Logic in Computer Science · Computer Science 2019-01-24 Albert Atserias , Anuj Dawar , Joanna Ochremiak

Elementary abelian groups are finite groups in the form of $A=(\mathbb{Z}/p\mathbb{Z})^r$ for a prime number $p$. For every integer $\ell>1$ and $r>1$, we prove a non-trivial upper bound on the $\ell$-torsion in class groups of every…

Number Theory · Mathematics 2020-01-10 Jiuya Wang

The notion of locally quasi-convex abelian group, introduce by Vilenkin, is extended to maximally almost-periodic non-necessarily abelian groups. For that purpose, we look at certain bornologies that can be defined on the set…

General Topology · Mathematics 2010-12-23 María V. Ferrer , Salvador Hernández

In this paper we apply the hyper-K\"ahler quotient construction to Lie groups with a left invariant hyper-K\"ahler structure under the action of a closed abelian subgroup by left multiplication. This is motivated by the fact that some known…

Differential Geometry · Mathematics 2007-05-23 M. L. Barberis , I. Dotti , A. Fino

We study the structure of Lie groups admitting left invariant abelian complex structures in terms of commutative associative algebras. If, in addition, the Lie group is equipped with a left invariant Hermitian structure, it turns out that…

Differential Geometry · Mathematics 2011-07-01 Adrian Andrada , Maria Laura Barberis , Isabel Dotti

In this paper, we construct Error-Correcting Graph Codes. An error-correcting graph code of distance $\delta$ is a family $C$ of graphs on a common vertex set of size $n$, such that if we start with any graph in $C$, we would have to modify…

Information Theory · Computer Science 2024-10-10 Swastik Kopparty , Aditya Potukuchi , Harry Sha

We give an efficient algorithm that transforms any bounded degree expander graph into another that achieves almost optimal (namely, near-quadratic, $d \leq 1/\lambda^{2+o(1)}$) trade-off between (any desired) spectral expansion $\lambda$…

Data Structures and Algorithms · Computer Science 2024-10-23 Fernando Granha Jeronimo , Tushant Mittal , Sourya Roy , Avi Wigderson

The power graph of a group $G$ is a graph with vertex set $G$, in which two vertices are adjacent if one is some power of the other. In the commuting graph, with $G$ as the vertex set, two vertices are joined by an edge if they commute in…

Group Theory · Mathematics 2024-06-04 Surbhi , Geetha Venkataraman

H\"older-Brascamp-Lieb inequalities provide upper bounds for a class of multilinear expressions, in terms of $L^p$ norms of the functions involved. They have been extensively studied for functions defined on Euclidean spaces.…

Classical Analysis and ODEs · Mathematics 2015-10-15 Michael Christ , James Demmel , Nicholas Knight , Thomas Scanlon , Katherine Yelick

For a finite group G, we study the higher commuting probabilities, namely the probabilities that r randomly chosen elements of G commute pairwise, together with the corresponding numbers of simultaneous conjugacy classes of commuting…

Group Theory · Mathematics 2026-05-05 Vadim E. Levit , Robert Shwartz

Let $S_g$ be the closed oriented surface of genus $g \geq 0$, and let $\mathrm{Mod}(S_g)$ be the mapping class group of $S_g$. For $g\geq 2$, we develop an algorithm to obtain a finite generating set for the liftable mapping class group…

Geometric Topology · Mathematics 2024-12-11 Neeraj K. Dhanwani , Pankaj Kapari , Kashyap Rajeevsarathy , Ravi Tomar

Let $G$ be an arbitrary group. We define a gain-line graph for a gain graph $(\Gamma,\psi)$ through the choice of an incidence $G$-phase matrix inducing $\psi$. We prove that the switching equivalence class of the gain function on the line…

Combinatorics · Mathematics 2021-01-19 Matteo Cavaleri , Daniele D'Angeli , Alfredo Donno

The global deformation theory of residually reducible Galois representations with fixed auxiliary conditions is studied. We show that $\bar{\rho}:\operatorname{Gal}(\bar{\mathbb{Q}}/\mathbb{Q})\rightarrow…

Number Theory · Mathematics 2022-02-24 Anwesh Ray

We consider 4-block $n$-fold integer programs, whose constraint matrix consists of $n$ copies of small matrices $A$, $B$, and $D$, and one copy of $C$, in a specific block structure. All existing algorithms along this line of research…

Data Structures and Algorithms · Computer Science 2019-10-28 Lin Chen , Lei Xu , Weidong Shi , Martin Koutecký

Let X be a compact manifold with a smooth action of a compact connected Lie group G. Let $L\to X$ be a complex line bundle. Using the Cartan complex for equivariant cohomology, we give a new proof of a theorem of Hattori and Yoshida which…

Differential Geometry · Mathematics 2007-05-23 Ignasi Mundet i Riera

We study the classical expander codes, introduced by Sipser and Spielman \cite{SS96}. Given any constants $0< \alpha, \varepsilon < 1/2$, and an arbitrary bipartite graph with $N$ vertices on the left, $M < N$ vertices on the right, and…

Information Theory · Computer Science 2022-01-11 Xue Chen , Kuan Cheng , Xin Li , Minghui Ouyang