English
Related papers

Related papers: Quasirandom groups enjoy interleaved mixing

200 papers

We prove that interpolation matrices for Generalized MultiQuadrics (GMQ) of order greater than one are almost surely nonsingular without polynomial addition, in any dimension and with any continuous random distribution of sampling points.…

Numerical Analysis · Mathematics 2024-04-17 A. Sommariva , M. Vianello

Let $G$ be a countable group, $\operatorname{Sub}(G)$ the (compact, metric) space of all subgroups of $G$ with the Chabauty topology and $\operatorname{Is}(G) \subset \operatorname{Sub}(G)$ the collection of isolated points. We denote by…

Group Theory · Mathematics 2017-05-17 Yair Glasner , Daniel Kitroser , Julien Melleray

An $n$-vertex graph $G$ of edge density $p$ is considered to be quasirandom if it shares several important properties with the random graph $G(n,p)$. A well-known theorem of Chung, Graham and Wilson states that many such `typical'…

Combinatorics · Mathematics 2020-06-17 E. Aigner-Horev , D. Conlon , H. Hàn , Y. Person , M. Schacht

A well-known conjecture in analytic number theory states that for every pair of sets $X,Y\subset\mathbb{Z}/p\mathbb{Z}$, each of size at least $\log ^C p$ (for some constant $C$) we have that the number of pairs $(x,y)\in X\times Y$ such…

Combinatorics · Mathematics 2015-12-18 Rudi Mrazović

In this paper we analyze the structure of some subalgebras of quantized enveloping algebras corresponding to unipotent and solvable subgroups of a simple Lie group G. These algebras have the non--commutative structure of iterated algebras…

High Energy Physics - Theory · Physics 2008-02-03 C. De Concini , Victor G. Kac , C. Procesi

Given a sequence of complex numbers {\rho}_n, we study the asymptotic distribution of the sets of parameters c {\epsilon} C such that the quadratic maps z^2 +c has a cycle of period n and multiplier {\rho}_n. Assume 1/n.log|{\rho}_n| tends…

Dynamical Systems · Mathematics 2013-06-13 Xavier Buff , Thomas Gauthier

Let $G$ be a non-trivial torsion free group and $t$ be an unknown. In this paper we consider three equations (over $G$) of arbitrary length and show that they have a solution (over $G$) provided two relations among their coefficients hold.…

Group Theory · Mathematics 2023-10-10 M. Fazeel Anwar , M. Bibi , S. Iqbal

Let $\G$ denote a bipartite distance-regular graph with vertex set $X$ and diameter $D \ge 3$. Fix $x \in X$ and let $L$ (resp. $R$) denote the corresponding lowering (resp. raising) matrix. We show that each $Q$-polynomial structure for…

Combinatorics · Mathematics 2011-08-12 Stefko Miklavic , Paul Terwilliger

For every dimension d, there is an infinite family of convex co-compact reflection groups of isometries of hyperbolic d-space --- the superideal (simplicial and cubical) reflection groups --- with the property that a random group at any…

Group Theory · Mathematics 2015-04-07 Danny Calegari

We prove that if $g(x,y)$ is a polynomial of constant degree $d$ that $y_2-y_1$ does not divide $g(x_1,y_1)-g(x_2,y_2)$, then for any finite set $A \subset \mathbb{R}$ \[ |X| \gg_d |A|^2, \quad \text{where} \…

Combinatorics · Mathematics 2019-05-29 Mehdi Makhul

We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an…

Group Theory · Mathematics 2007-05-23 Ilya Kapovich , Richard Weidmann

Let $G$ be a finite $D$-quasirandom group and $A \subset G^{k}$ a $\delta$-dense subset. Then the density of the set of side lengths $g$ of corners \[ \{(a_{1},\dots,a_{k}),(ga_{1},a_{2},\dots,a_{k}),\dots,(ga_{1},\dots,ga_{k})\} \subset A…

Combinatorics · Mathematics 2018-08-20 Pavel Zorin-Kranich

In this work we show that for every $d < \infty$ and the Ising model defined on $G(n,d/n)$, there exists a $\beta_d > 0$, such that for all $\beta < \beta_d$ with probability going to 1 as $n \to \infty$, the mixing time of the dynamics on…

Probability · Mathematics 2009-01-29 Elchanan Mossel , Allan Sly

Let $D\neq 1$ be a fixed squarefree integer. For elliptic curves $E/\mathbb{Q}$, writing $E_D$ for the quadratic twist by $D$, we consider the question of how often $E(\mathbb{Q})$ and $E_D(\mathbb{Q})$ generate $E(\mathbb{Q}(\sqrt{D}))$.…

Number Theory · Mathematics 2024-01-18 Ross Paterson

Let $G$ be a finite group and construct a graph $\Delta(G)$ by taking $G\setminus\{1\}$ as the vertex set of $\Delta(G)$ and by drawing an edge between two vertices $x$ and $y$ if $\langle x,y\rangle$ is cyclic. Let $K(G)$ be the set…

Group Theory · Mathematics 2024-02-12 David G. Costanzo , Mark L. Lewis , Stefano Schmidt , Eyob Tsegaye , Gabe Udell

Given a group $G$, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of $G$ where each element of $G$ is included in the generating set independently at random with probability $p$. In this article, we…

Combinatorics · Mathematics 2026-05-29 Demetres Christofides , Klas Markström , Christina Savvidou

We consider the relative group presentation $\mathcal{P} = \langle G, \mathbf{x} | \mathbf{r} \rangle$ where $\mathbf{x} = \{ x \}$ and $\mathbf{r} = \{ xg_1 xg_2 xg_3 x^{-1} g_4 \}$. We show modulo a small number of exceptional cases…

Group Theory · Mathematics 2017-08-04 Abd Ghafur Bin Ahmad , Muna A Al-Mulla , Martin Edjvet

Given a group G, the model $\mathcal{G}(G,p)$ denotes the probability space of all Cayley graphs of G where each element of the generating set is chosen independently at random with probability p. In this article we show that for any…

Combinatorics · Mathematics 2011-08-18 Demetres Christofides , Klas Markström

Two versions of the Ajtai-Szemer\'edi Theorem are considered in the Cartesian square of a finite non-Abelian group $G$. In case $G$ is sufficiently quasirandom, we obtain strong forms of both versions: if $E \subseteq G\times G$ is fairly…

Combinatorics · Mathematics 2015-05-20 Tim Austin

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…

Combinatorics · Mathematics 2018-04-06 Thao Do