English
Related papers

Related papers: Efficient arithmetic regularity and removal lemmas…

200 papers

Let B be the Lie algebra with basis {L_{i,j},C|i,j\in Z} and relations [L_{i,j},L_{k,l}]=((j+1)k-i(l+1))L_{i+k,j+l}+i\delta_{i,-k}\delta_{j+l,-2}C, [C,L_{i,j}]=0. It is proved that an irreducible highest weight B-module is quasifinite if…

Representation Theory · Mathematics 2007-05-23 Qifen Jiang , Yuezhu Wu

We study exponential sums whose coefficients are completely multiplicative and belong to the complex unit disc. Our main result shows that such a sum has substantial cancellation unless the coefficient function is essentially a Dirichlet…

Number Theory · Mathematics 2010-10-25 Leo Goldmakher

Designs of data structures for approximate membership queries with false-positive errors that support both insertions and deletions stipulate the following two conditions: (1) Duplicate insertions are prohibited, i.e., it is prohibited to…

Data Structures and Algorithms · Computer Science 2024-12-30 Aryan Agarwala , Guy Even

Take a set of balls in $\mathbb R^d$. We find a subset of pairwise disjoint balls whose combined perimeter controls the perimeter of the union of the original balls. This can be seen as a boundary version of the Vitali covering lemma. We…

Classical Analysis and ODEs · Mathematics 2025-07-22 Julian Weigt

Regular and distance-regular characterizations of general graphs are well-known. In particular, the spectral excess theorem states that a connected graph G is distance-regular if and only if its spectral excess (a number that can be…

Combinatorics · Mathematics 2013-09-27 A. Abiad , C. Dalfò , M. A. Fiol

We investigate subsets with small sumset in arbitrary abelian groups. For an abelian group $G$ and an $n$-element subset $Y \subseteq G$ we show that if $m \ll s^2/(\log n)^2$, then the number of subsets $A \subseteq Y$ with $|A| = s$ and…

Combinatorics · Mathematics 2025-04-15 Dingyuan Liu , Letícia Mattos , Tibor Szabó

Let $G$ denotes a finite abelian group of order $n$ and Davenport constant $D$, and put $m= n+D-1$. Let $x=(x_1, ..., x_m)\in G^m$ be a sequence with a maximal repetition $\ell$ attained by $x_m$ and put $r=\min(D,\ell)$. Let $w=(w_1, ...,…

Combinatorics · Mathematics 2007-11-27 Yahya O. Hamidoune

We show that for some absolute (explicit) constant $C$, the following holds for every finitely generated group $G$, and all $d >0$: If there is some $ R_0 > \exp(\exp(Cd^C))$ for which the number of elements in a ball of radius $R_0$ in a…

Group Theory · Mathematics 2010-04-09 Yehuda Shalom , Terence Tao

We formulate Lehmer's Problem about the Mahler measure of polynomials for general compact abelian groups, introducing a Lehmer constant for each such group. We show that all nontrivial connected compact groups have the same Lehmer constant,…

Number Theory · Mathematics 2015-12-23 Douglas Lind

When monic integral polynomials of degree $n \geq 2$ are ordered by the maximum of the absolute value of their coefficients, the Hilbert irreducibility theorem implies that asymptotically 100% are irreducible and have Galois group…

Number Theory · Mathematics 2019-10-08 Robert J. Lemke Oliver , Frank Thorne

In the representation theory of real reductive Lie groups, many objects have finiteness properties. For example, the lengths of Verma modules and principal series representations are finite, and more precisely, they are bounded. In this…

Representation Theory · Mathematics 2021-09-22 Masatoshi Kitagawa

Consider a graph G with an assignment of costs to vertices. Even if G and all its subgraphs admit balanced separators of sublinear size, G may only admit a balanced separator of sublinear cost after deleting a small set Z of exceptional…

Combinatorics · Mathematics 2021-09-20 Zdeněk Dvořák

We introduce a new variant of Szemer\'edi's regularity lemma which we call the "sparse regular approximation lemma" (SRAL). The input to this lemma is a graph $G$ of edge density $p$ and parameters $\epsilon, \delta$, where we think of…

Combinatorics · Mathematics 2016-10-11 Guy Moshkovitz , Asaf Shapira

For any irreducible character $\chi$ of a finite group $G$, let $\theta(\chi)$ denote the proportion of elements $g\in G$ for which $\chi(g)$ is either zero or a root of unity. Then for any $L\in[1/2,1]$ and any $\epsilon>0$, there exists…

Representation Theory · Mathematics 2025-07-22 Alexander R. Miller

We study the number of $s$-element subsets $J$ of a given abelian group $G$, such that $|J+J|\leq K|J|$. Proving a conjecture of Alon, Balogh, Morris and Samotij, and improving a result of Green and Morris, who proved the conjecture for $K$…

Combinatorics · Mathematics 2019-05-06 Marcelo Soares Campos

In this article we study higher homological properties of $n$-levelled algebras and connect them to properties of the underlying graphs. Notably, to each $2$-representation-finite quadratic monomial algebra $\Lambda$ we associate a…

Representation Theory · Mathematics 2024-11-04 Karin M. Jacobsen , Mads Hustad Sandøy , Laertis Vaso

The bilinear Bogolyubov argument for $\mathbb{F}_p^n$ states that if we start with a dense set $A \subseteq \mathbb{F}_p^n \times \mathbb{F}_p^n$ and carry out sufficiently many steps where we replace every row or every column of $A$ by the…

Combinatorics · Mathematics 2024-12-30 L. Milićević

Let $G$ be a complex connected reductive algebraic group and let $G_{\mathbb{R}}$ be a real form of $G$. We construct a sequence of functors $L_i\mathcal{R}$ from admissible (resp. finite-length) representations of $G$ to admissible (resp.…

Representation Theory · Mathematics 2022-04-25 Lucas Mason-Brown

Let $\mathcal A = \{A_{ij} \}_{i, j \in \mathcal I}$, where $\mathcal I$ is an index set, be a doubly indexed family of matrices, where $A_{ij}$ is $n_i \times n_j$. For each $i \in \mathcal I$, let $\mathcal V_i$ be an $n_i$-dimensional…

Rings and Algebras · Mathematics 2018-12-03 Dana Lahat , Christian Jutten , Helene Shapiro

It is known that families of graphs with a semialgebraic edge relation of bounded complexity satisfy much stronger regularity properties than arbitrary graphs, and that they can be decomposed into very homogeneous semialgebraic pieces up to…

Logic · Mathematics 2016-02-25 Artem Chernikov , Sergei Starchenko