Related papers: Natural quasirandomness properties
Three philosophical principles are often quoted in connection with Leibniz: "objects sharing the same properties are the same object", "everything can possibly exist, unless it yields contradiction", "the ideal elements correctly determine…
Sidorenko's conjecture states that, for all bipartite graphs $H$, quasirandom graphs contain asymptotically the minimum number of copies of $H$ taken over all graphs with the same order and edge density. While still open for graphs, the…
In this paper we develop a framework to study observability for uniform hypergraphs. Hypergraphs, being extensions of graphs, allow edges to connect multiple nodes and unambiguously represent multi-way relationships which are ubiquitous in…
It is shown how traditional development of theories of fluids based upon the concept of physical clustering can be adapted to an alternative local clustering definition. The alternative definition can preserve a detailed valence description…
We construct the ordinary irreducible representations of the group of automorphisms of a finite rooted tree and we get a natural parametrization of them. To achieve this goals, we introduce and study the combinatorics of tree compositions,…
We prove a few simple cases of a random graph statement that would imply the "second" Kahn--Kalai Conjecture. Even these cases turn out to be reasonably challenging, and it is hoped that the ideas introduced here may lead to further…
The configuration model is the most natural model to generate a random multigraph with a given degree sequence. We use the notion of dense graph limits to characterize the special form of limit objects of convergent sequences of…
Random graphs with a given degree sequence are often constructed using the configuration model, which yields a random multigraph. We may adjust this multigraph by a sequence of switchings, eventually yielding a simple graph. We show that,…
Consider the binomial model $G^{d+1}(n,p)$ of the random $(d+1)$-uniform hypergraph on $n$ vertices, where each edge is present, independently of one another, with probability $p:\mathbb{N}\to[0,1]$. We prove that, for all…
Persistent homology enables fast and computable comparison of topological objects. However, it is naturally limited to the analysis of topological spaces. We extend the theory of persistence, by guaranteeing robustness and computability to…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…
Diverse experimental constraints now motivate models of supersymmetry breaking in which some superpartners have masses well above the weak scale. Three alternatives are focus point supersymmetry and inverted hierarchy models, which embody a…
We consider partially ordered sets of combinatorial structures under consecutive orders, meaning that two structures are related when one embeds in the other such that `consecutive' elements remain consecutive in the image. Given such a…
In the paper, we represent a comparison analysis of the methods of the topological alignment and extract the main mathematical principles forming the base of the concept. The main narrative is devoted to the so-called coupled methods…
In this paper, we propose a general mechanism for the existence of quasicrystals in spatially extended systems (partial differential equations with Euclidean symmetry). We argue that the existence of quasicrystals with higher order…
We develop a general framework to study hyperuniformity of various mathematical models of quasicrystals. Using this framework we provide examples of non-hyperuniform quasicrystals which unlike previous examples are not limit-quasiperiodic.…
In recent work, we introduced topological notions of simple normal crossings symplectic divisor and variety, showed that they are equivalent, in a suitable sense, to the corresponding geometric notions, and established a topological…
A celebrated result in bifurcation theory is that global connected sets of non-trivial solutions bifurcate from trivial solutions at non-zero eigenvalues of odd algebraic multiplicity of the linearized problem when the operators involved…
For a graph consisting of parallel connected subgraphs we express the characteristic function of the boundary value problem with generalized Neumann conditions at both joining points via characteristic functions of different boundary…