Related papers: Superlinear subset partition graphs with dimension…
In this paper we study hypergraphs definable in an algebraically closed field. Our goal is to show, in the spirit of the so-called transference principles in extremal combinatorics, that if a given algebraic hypergraph is "dense" in a…
We consider the problem of achieving average consensus in the minimum number of linear iterations on a fixed, undirected graph. We are motivated by the task of deriving lower bounds for consensus protocols and by the so-called "definitive…
Supersymmetry broken geometrically in extra dimensions naturally leads to a nearly degenerate spectrum for superparticles, ameliorating the bounds from the current searches at the LHC. We present a minimal such model with a single extra…
We propose a novel construction of finite hypergraphs and relational structures that is based on reduced products with Cayley graphs of groupoids. To this end we construct groupoids whose Cayley graphs have large girth not just in the usual…
Given a graph $H$, a balanced subdivision of $H$ is obtained by replacing all edges of $H$ with internally disjoint paths of the same length. In this paper, we prove that for any graph $H$, a linear-in-$e(H)$ bound on average degree…
Let $G$ be a finite group and let $H_1,H_2<G$ be two subgroups. In this paper, we are concerned with the bipartite graph whose vertices are $G/H_1\cup G/H_2$ and a coset $g_1H_1$ is connected with another coset $g_2H_2$ if and only if…
Statistical models on infinite graphs may exhibit inhomogeneous thermodynamic behaviour at macroscopic scales. This phenomenon is of geometrical origin and may be properly described in terms of spectral partitions into subgraphs with well…
We study the Hausdorff dimension of self-similar sets and measures on the line. We show that if the dimension is smaller than the minimum of 1 and the similarity dimension, then at small scales there are super-exponentially close cylinders.…
We give new, explicit and asymptotically sharp, lower bounds for dimensions of irreducible modular representations of finite symmetric groups.
Asymptotic properties of random regular graphs are object of extensive study in mathematics. In this note we argue, based on theory of spin glasses, that in random regular graphs the maximum cut size asymptotically equals the number of…
We extend Tanaka theory to the context of supergeometry and obtain an upper bound on the supersymmetry dimension of geometric structures related to strongly regular bracket-generating distributions on supermanifolds and their structure…
In order to deal with multidimensional structure representations of real-world networks, as well as with their worst-case irreducible information content analysis, the demand for new graph abstractions increases. This article investigates…
We revisit the classical question of the relationship between the diameter of a graph and its expansion properties. One direction is well understood: expander graphs exhibit essentially the lowest possible diameter. We focus on the reverse…
We derive the relation between the Hilbert space of certain geometries under the Bohr-Sommerfeld quantization and the perturbative prepotentials for the supersymmetric five-dimensional SU(N) gauge theories with massive fundamental matters…
We construct a sequence of finite graphs that weakly converge to a Cayley graph, but there is no labelling of the edges that would converge to the corresponding Cayley diagram. A similar construction is used to give graph sequences that…
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
Graphs and hypergraphs are foundational structures in discrete mathematics. They have many practical applications, including the rapidly developing field of bioinformatics, and more generally, biomathematics. They are also a source of…
We consider changes in properties of a subgraph of an infinite graph resulting from the addition of open edges of Bernoulli percolation on the infinite graph to the subgraph. We give the triplet of an infinite graph, one of its subgraphs,…
We initiate a study of asymptotic dimension for locally compact groups. This notion extends the existing invariant for discrete groups and is shown to be finite for a large class of residually compact groups. Along the way, the notion of…
We give quadratic upper bounds for the asymptotic dimensions of the arc graphs and disk graphs.