Related papers: Quasirandom additive sets and Cayley hypergraphs
It is an important fact that extremal discrete structures -- that is, discrete structures of maximal size among those that avoid certain configurations -- exhibit strong pseudorandom behavior. We present instances of this phenomenon in the…
We investigate extremal problems for quasirandom hypergraphs. We say that a $3$-uniform hypergraph $H=(V,E)$ is $(d,\eta)$-quasirandom if for any subset $X\subseteq V$ and every set of pairs $P\subseteq V\times V$ the number of pairs…
We establish a number of "concatenation theorems" that assert, roughly speaking, that if a function exhibits "polynomial" (or "Gowers anti-uniform", "uniformly almost periodic", or "nilsequence") behaviour in two different directions…
The notions and certain fundamental characteristics of the proximal and limiting normal cones with respect to a set are first presented in this paper. We present the ideas of the limiting coderivative and subdifferential with respect to a…
Due to their elegant and simple nature, unitary Cayley graphs have been an active research topic in the literature. These graphs are naturally connected to several branches of mathematics, including number theory, finite algebra,…
Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…
The Cheeger constant of a graph, or equivalently its coboundary expansion, quantifies the expansion of the graph. This notion assumes an implicit choice of a coefficient group, namely, $\mathbb{F}_2$. In this paper, we study Cheeger-type…
In complex dynamics, the bungee set is defined as the set points whose orbit is neither bounded nor tends to infinity. In this paper we study, for the first time, the bungee set of a quasiregular map of transcendental type. We show that…
This paper is concerned with statistical inference for infinite range interaction Gibbs point processes and in particular for the large class of Ruelle superstable and lower regular pairwise interaction models. We extend classical…
We prove that asymptotically almost surely, the random Cayley sum graph over a finite abelian group $G$ has edge density close to the expected one on every induced subgraph of size at least $\log^c |G|$, for any fixed $c > 1$ and $|G|$…
Nearest-neighbor methods have become popular in statistics and play a key role in statistical learning. Important decisions in nearest-neighbor methods concern the variables to use (when many potential candidates exist) and how to measure…
A complex unit gain graph is a simple graph in which each orientation of an edge is given a complex number with modulus 1 and its inverse is assigned to the opposite orientation of the edge. In this article, first we establish bounds for…
Polytopes from subgraph statistics are important in applications and conjectures and theorems in extremal graph theory can be stated as properties of them. We have studied them with a view towards applications by inscribing large explicit…
Hypergraphs are structures that can be decomposed or described; in other words they are recursively countable. Here, we get exact and asymptotic enumeration results on hypergraphs by means of exponential generating functions. The number of…
For any given graph $H$, one may define a natural corresponding functional $\|.\|_H$ for real-valued functions by using homomorphism density. One may also extend this to complex-valued functions, once $H$ is paired with a $2$-edge-colouring…
This paper investigates quasi-isometries between graphs with variable edge lengths. A quasi-isometry is a mapping between metric spaces that approximately preserves distances, allowing for a bounded amount of additive and multiplicative…
This note is a contribution to large scale geometry. More precisely, we introduce the intrinsically quasi-isometric sections in metric spaces and we investigate their properties: the Ahlfors-David regularity in large scale; following…
We construct nontrivial homomorphisms from the quasi group of some cubic surfaces over $\bbF_{\!p}$ into a group. We show experimentally that the homomorphisms constructed are the only possible ones and that there are no nontrivial…
Eastwood and Ezhov generalized the Cayley surface to the Cayley hypersurface in each dimension, proved some characteristic properties of the Cayley hypersurface and conjectured that a homogeneous hypersurface in affine space satisfying…
The well-known regularity lemma of E. Szemer\'edi for graphs (i.e. 2-uniform hypergraphs) claims that for any graph there exists a vertex partition with the property of quasi-randomness. We give a simple construction of such a partition. It…