Related papers: An arithmetic algebraic regularity lemma

Let $F$ be a finite field of odd cardinality $q$, $A=F[T]$ the polynomial ring over $F$, $k=F(T)$ the rational function field over $F$ and $\mathcal{H}$ the set of square-free monic polynomials in $A$ of degree odd. If $D\in\mathcal{H}$, we…

In this paper we study some local and global regularity properties of Fourier series obtained as fractional integrals of modular forms. In particular we characterize the differentiability at rational points, determine their H\"older…

We study definably compact definably connected groups definable in a sufficiently saturated real closed field $R$. We introduce the notion of group-generic point for $\bigvee$-definable groups and show the existence of group-generic points…

We give a "regularity lemma" for degree-d polynomial threshold functions (PTFs) over the Boolean cube {-1,1}^n. This result shows that every degree-d PTF can be decomposed into a constant number of subfunctions such that almost all of the…

The representation complexity of a bipartite graph $G=(P,Q)$ is the minimum size $\sum_{i=1}^s (|A_i|+|B_i|)$ over all possible ways to write $G$ as a (not necessarily disjoint) union of complete bipartite subgraphs $G=\cup_{i=1}^s…

Suppose one needs to change the direction of at least $\epsilon n^2$ edges of an $n$-vertex tournament $T$, in order to make it $H$-free. A standard application of the regularity method shows that in this case $T$ contains at least…

Let $o(G)$ be the average order of a finite group $G$. We show that if $o(G)<c$, where $c\in \lbrace \frac{13}{6}, \frac{11}{4}\rbrace$, then $G$ is an elementary abelian 2-group or a solvable group, respectively. Also, we prove that the…

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…

Fixing an arithmetic lattice $\Gamma$ in an algebraic group $G$, the commensurability growth function assigns to each $n$ the cardinality of the set of subgroups $\Delta$ with $[\Gamma : \Gamma \cap \Delta] [\Delta: \Gamma \cap \Delta] =…

New realizations of finite W algebras are constructed by relaxing the usual constraint conditions. Then, finite W algebras are recognized in the Heisenberg quantization recently proposed by Leinaas and Myrheim, for a system of two identical…

We prove that a finite coprime linear group G in characteristic p>=(|G|-1)/2 has a regular orbit. This bound on p is best possible. We also give an application to blocks with abelian defect groups.

We analyse the complexity of the computation of the class group structure, regulator, and a system of fundamental units of a certain class of number fields. Our approach differs from Buchmann's, who proved a complexity bound of L(1/2,O(1))…

This paper establishes lower bounds for two kinds of arithmetic regularity partitions, building on constructions of Green [arXiv:math/0310476v2] and Hosseini, Lovett, Moshkovitz, and Shapira [arXiv:1405.4409]. The first kind occurs in the…

Let $G$ be a complex connected reductive algebraic group that acts on a smooth complex algebraic variety $X$, and let $E$ be a $G$-equivariant algebraic vector bundle over $X$. A section of $E$ is regular if it is transversal to the zero…

We give a brief exposition and proof of the arithmetic regularity lemma of Green and Tao in the abelian ($U^2$) case, over $\{1,\dots,N\}$. This may be useful to those who need just the $U^2$ case of the lemma, as the general case is…

Let $J_G$ be the binomial edge ideal of a graph $G$. We characterize all graphs whose binomial edge ideals, as well as their initial ideals, have regularity $3$. Consequently we characterize all graphs $G$ such that $J_G$ is extremal…

Szemeredi's Regularity Lemma is a very useful tool of extremal combinatorics. Recently, several refinements of this seminal result were obtained for special, more structured classes of graphs. We survey these results in their rich…

We use model-theoretic tools originating from stability theory to derive a result we call the Finitary Substitute Lemma, which intuitively says the following. Suppose we work in a stable graph class C, and using a first-order formula {\phi}…

The prime graph question asks whether the Gruenberg-Kegel graph of an integral group ring $\mathbb Z G$ , i.e. the prime graph of the normalised unit group of $\mathbb Z G$ coincides with that one of the group $G$. In this note we prove for…