Searcharxiv⌕ Search

arXiv subjects

Balazs Szegedy

Publications and source records attributed to Balazs Szegedy.

30 records · Page 2Linked to original sources
arXiv2010

Higher order Fourier analysis as an algebraic theory III

For every natural number k we introduce the notion of k-th order convolution of functions on abelian groups. We study the group of convolution preserving automorphisms of function algebras in the limit. It turns out that such groups have k-nilpotent factor groups explaining why k-th order Fourier analysis has non-commutative features. To demonstrate our method in the quadratic case we develop a new quadratic representation theory on finite abelian groups. We introduce the notion of a quadrtic nil-morphism of an abelian group into a two step nil-manifold. We prove a structure theorem saying that any bounded function on a finite abelian group is decomposable into a structured part (which is the composition of a nil-morphism with a bounded complexity continuous function) and a random looking part with small U3 norm. It implies a new inverse theorem for the U3 norm. (The general case for Un, n>3 will be discussed in the next part of this sequence.) We point out that our framework creates interesting limit objects for functions on finite (or compact) abelian groups that are measurable functions on nil-manifolds.

math.CO↗
arXiv2009

Higher order Fourier analysis as an algebraic theory II

Our approach to higher order Fourier analysis is to study the ultra product of finite (or compact) Abelian groups on which a new algebraic theory appears. This theory has consequences on finite (or compact) groups usually in the form of approximative statements. The present paper is the second part of a paper in which higher order characters and decompositions were introduced. We generalize the concept of the Pontrjagin dual group and introduce higher order versions of it. We study the algebraic structure of the higher order dual groups. We prove a simple formula for the Gowers uniformity norms in terms of higher order decompositions. We present a simple spectral algorithm to produce higher order decompositions. We briefly study a multi linear version of Fourier analysis. Along these lines we obtain new inverse theorems for Gowers's norms.

math.CO↗
arXiv2009

Higher order Fourier analysis as an algebraic theory I

Ergodic theory, Higher order Fourier analysis and the hyper graph regularity method are three possible approaches to Szemerédi type theorems in abelian groups. In this paper we develop an algebraic theory that creates a connection between these approaches. Our main method is to take the ultra product of abelian groups and to develop a precise algebraic theory of higher order characters on it. These results then can be turned back into approximative statements about finite Abelian groups.

math.CO↗
arXiv2008

The Symmetry Preserving Removal Lemma

In this note we observe that in the hyper-graph removal lemma the edge removal can be done in a way that the symmetries of the original hyper-graph remain preserved. As an application we prove the following generalization of Szemerédi's Theorem on arithmetic progressions. If in an Abelian group $A$ there are sets $S_1,S_2...,S_t$ such that the number of arithmetic progressions $x_1,x_2,...,x_t$ with $x_i\in S_i$ is $o(|A|^2)$ then we can shrink each $S_i$ by $o(|A|)$ elements such that the new sets don't have such a diagonal arithmetic progression.

math.CO↗
arXiv2008

Testing properties of graphs and functions

We define an analytic version of the graph property testing problem, which can be formulated as studying an unknown 2-variable symmetric function through sampling from its domain and studying the random graph obtained when using the function values as edge probabilities. We give a characterization of properties testable this way, and extend a number of results about ``large graphs'' to this setting. These results can be applied to the original graph-theoretic property testing.

math.CO↗
arXiv2007

On finite groups whose derived subgroup has bounded rank

Let $G$ be a finite group with derived subgroup of rank $r$. We prove that $\gzz\leq |G'|^{2r}$. Motivated by the results of I. M. Isaacs in \cite{isa} we show that if $G$ is capable then $\gz\leq |G'|^{4r}$. This answers a question of L. Pyber. We prove that if $G$ is a capable $p$-group then the rank of $G/\mathbf{Z}(G)$ is bounded above in terms of the rank of $G'$.

math.GR↗
arXiv2005

Group-theoretic algorithms for matrix multiplication

We further develop the group-theoretic approach to fast matrix multiplication introduced by Cohn and Umans, and for the first time use it to derive algorithms asymptotically faster than the standard algorithm. We describe several families of wreath product groups that achieve matrix multiplication exponent less than 3, the asymptotically fastest of which achieves exponent 2.41. We present two conjectures regarding specific improvements, one combinatorial and the other algebraic. Either one would imply that the exponent of matrix multiplication is 2.

math.GR↗
arXiv2005

Contractors and connectors of graph algebras

We study generalizations of the "contraction-deletion" relation of the Tutte polynomial, and other similar simple operations, to other graph parameters. The question can be set in the framework of graph algebras introduced by Freedman, Lovasz and Schrijver, and it relates to their behavior under basic graph operations like contraction and subdivision. Graph algebras were introduced to study and characterize homomorphism functions. We prove that for homomorphism functions, these graph algebras have special elements called ``contractors'' and ``connectors''. This gives a new characterization of homomorphism functions.

math.CO↗
arXiv2005

Edge coloring models and reflection positivity

Solving a conjecture of M. H. Freedman, L. Lovász and A. Schrijver we prove that a graph parameter is edge reflection positive and multiplicative if and only if it can be represented by an edge coloring model.

math.CO↗
arXiv2004

Coverings of abelian groups and vector spaces

We study the question how many subgroups, cosets or subspaces are needed to cover a finite Abelian group or a vector space if we have some natural restrictions on the structure of the covering system. For example we determine, how many cosets we need, if we want to cover all but one element of an Abelian group. This result is a group theoretical extension of the theorem of Brouwer, Jamison and Schrijver about the blocking number of an affine space. We show that these covering problems are closely related to combinatorial problems, including the so called additive basis conjecture, the three-flow conjecture, and a conjecture of Alon, Jaeger and Tarsi about nowhere zero vectors.

math.GR↗
arXiv2004

Limits of dense graph sequences

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable function on [0,1]. This limit object determines all the limits of subgraph densities. We also show that the graph parameters obtained as limits of subgraph densities can be characterized by ``reflection positivity'', semidefiniteness of an associated matrix. Conversely, every such function arises as a limit object. Along the lines we introduce a rather general model of random graphs, which seems to be interesting on its own right.

math.CO↗