English
Related papers

Related papers: Corners over quasirandom groups

200 papers

A corner is a set of three points in $\mathbf{Z}^2$ of the form $(x, y), (x + d, y), (x, y + d)$ with $d \neq 0$. We show that for infinitely many $N$ there is a set $A \subset [N]^2$ of size $2^{-(c + o(1)) \sqrt{\log_2 N}} N^2$ not…

Combinatorics · Mathematics 2021-03-11 Ben Green

We give an example of a long range Bernoulli percolation process on a group non-quasi-isometric with $\mathbb{Z}$, in which clusters are almost surely finite for all values of the parameter. This random graph admits diverse equivalent…

Probability · Mathematics 2020-08-12 Agelos Georgakopoulos , John Haslegrave

In this paper we introduce the concept of corner element of a generalized numerical semigroup, which extends in a sense the idea of conductor of a numerical semigroup to generalized numerical semigroups in higher dimensions. We present…

Group Theory · Mathematics 2022-01-19 Matheus Bernardini , Wanderson Tenório , Guilherme Tizziotti

We introduce and study the concept of cyclicity degree of a finite group $G$. This quantity measures the probability of a random subgroup of $G$ to be cyclic. Explicit formulas are obtained for some particular classes of finite groups. An…

Group Theory · Mathematics 2015-04-08 Marius Tărnăuceanu , László Tóth

Let G be a finitely generated group with a given word metric. The asymptotic density of elements in G that have a particular property P is defined to be the limit, as r goes to infinity, of the proportion of elements in the ball of radius r…

Group Theory · Mathematics 2007-05-23 Pallavi Dani

In this paper, we study dense subsets of boundaries of CAT(0) groups. Suppose that a group $G$ acts geometrically on a CAT(0) space $X$ and suppose that there exists an element $g_0\in G$ such that (1) $Z_{g_0}$ is finite, (2) $X\setminus…

Group Theory · Mathematics 2007-05-23 Tetsuya Hosaka

Let $C$ be a smooth, projective and geometrically connected curve defined over a finite field $\mathbb{F}_q(C)$. Given a semisimple $C-S$-group scheme $\underline{G}$ where $S$ is a finite set of closed points of $C$, we describe the set of…

Algebraic Geometry · Mathematics 2021-05-26 Rony A. Bitan , Ralf Kohl , Claudia Schoemann

A random geometric digraph $G_n$ is constructed by taking $\{X_1,X_2,... X_n\}$ in $\mathbb{R}^2$ independently at random with a common bounded density function. Each vertex $X_i$ is assigned at random a sector $S_i$ of central angle…

Combinatorics · Mathematics 2019-09-18 Yilun Shang

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

Dynamical Systems · Mathematics 2025-04-14 Dimitrios Charamaras , Ioannis Kousek , Andreas Mountakis , Tristán Radić

Let $G$ be a finite abelian group and $A$ be a subset of $G \times G$ which is corner--free, meaning that there are no $x, y \in G$ and $d \in G \setminus \{0\}$ such that $(x, y)$, $(x+d, y)$, $(x, y+d) \in A$. We prove that \[|A| \le…

Combinatorics · Mathematics 2025-07-15 Michael Jaber , Yang P. Liu , Shachar Lovett , Anthony Ostuni , Mehtaab Sawhney

A subset $S\subseteq V$ in a graph $G=(V,E)$ is a $k$-quasiperfect dominating set (for $k\geq 1$) if every vertex not in $S$ is adjacent to at least one and at most $k$ vertices in $S$. The cardinality of a minimum $k$-quasiperfect…

Combinatorics · Mathematics 2014-12-01 José Cáceres , Carmen Hernando , Mercè Mora , Ignacio M. Pelayo , María Luz Puertas

Consider a `dense' Erd\H{o}s--R\'enyi random graph model $G=G_{n,M}$ with $n$ vertices and $M$ edges, where we assume the edge density $M/\binom{n}{2}$ is bounded away from 0 and 1. Fix $k=k(n)$ with $k/n$ bounded away from 0 and~1, and let…

Combinatorics · Mathematics 2025-04-01 Paul Balister , Emil Powierski , Alex Scott , Jane Tan

We define the limiting density of a minor-closed family of simple graphs F to be the smallest number k such that every n-vertex graph in F has at most kn(1+o(1)) edges, and we investigate the set of numbers that can be limiting densities.…

Combinatorics · Mathematics 2010-10-18 David Eppstein

The Divisibility Graph of a finite group $G$ has vertex set the set of conjugacy class lengths of non-central elements in $G$ and two vertices are connected by an edge if one divides the other. We determine the connected components of the…

Group Theory · Mathematics 2016-12-15 Adeleh Abdolghafourian , Mohammad A. Iranmanesh , Alice C. Niemeyer

In this m\'emoire we study quasiperiodic cocycles in semi-simple compact Lie groups. For the greatest part of our study, we will focus ourselves to one-frequency cocyles. We will prove that $C^{\infty}$ reducible cocycles are dense in the…

Dynamical Systems · Mathematics 2018-09-21 Nikolaos Karaliolios

Consider a hyperbolic group G and a quasiconvex subgroup H of infinite index. We construct a set-theoretic section s of the quotient map (of sets) from G to G/H such that s(G/H) is a net in G; that is, any element of G is a bounded distance…

Geometric Topology · Mathematics 2007-05-23 Thomas Mack

We develop a cluster expansion for the probability of full connectivity of high density random networks in confined geometries. In contrast to percolation phenomena at lower densities, boundary effects, which have previously been largely…

Disordered Systems and Neural Networks · Physics 2015-06-03 Justin Coon , Carl P. Dettmann , Orestis Georgiou

The $k$-gonal models of random groups are defined as the quotients of free groups on $n$ generators by cyclically reduced words of length $k$. As $k$ tends to infinity, this model approaches the Gromov density model. In this paper we show…

Group Theory · Mathematics 2021-04-14 MurphyKate Montee

In [3] is was shown that for any group $G$ whose rank (i.e., minimal number of generators) is at most 3, and any finite index subgroup $H\leq G$ with index $[G:H]\geq rank(G)$, one can always find a left-right transversal of $H$ which…

Group Theory · Mathematics 2019-12-06 Maurice Chiodo , Robert Crumplin , Oscar Donlan , Paweł Piwek

We study generalized quasirandom graphs whose vertex set consists of $q$ parts (of not necessarily the same sizes) with edges within each part and between each pair of parts distributed quasirandomly; such graphs correspond to the…

Combinatorics · Mathematics 2023-08-22 Andrzej Grzesik , Daniel Kral , Oleg Pikhurko