Related papers: High dimensional expansion using zig-zag product
The structure of the renormalization-group flows in a model with three quartic coupling constants is studied within the $\epsilon$-expansion method up to three-loop order. Twofold degeneracy of the eigenvalue exponents for the…
The {\em overlap number} of a finite $(d+1)$-uniform hypergraph $H$ is defined as the largest constant $c(H)\in (0,1]$ such that no matter how we map the vertices of $H$ into $\R^d$, there is a point covered by at least a $c(H)$-fraction of…
Ryser's Conjecture states that any $r$-partite $r$-uniform hypergraph has a vertex cover of size at most $r - 1$ times the size of the largest matching. For $r = 2$, the conjecture is simply K\"onig's Theorem and every bipartite graph is a…
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well known for every admissible n. We generalize this result in two ways. First we define the expander property of 3-uniform hypergraphs and…
We present a high-accuracy procedure for electronic structure calculations of strongly correlated materials. To address limitations in current electronic structure methods, we employ density functional theory in combination with the…
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…
Bootstrap percolation on a graph is a deterministic process that iteratively enlarges a set of occupied sites by adjoining points with at least $\theta$ occupied neighbors. The initially occupied set is random, given by a uniform product…
In this article we conjecture a 4-dimensional characterization of tightness: a contact structure is tight if and only if a slice-Bennequin inequality holds for smoothly embedded surfaces in Yx[0,1]. An affirmative answer to our conjecture…
Given a spectral triple on a $C^*$-algebra $\mathcal A$ together with a unital injective endomorphism $\alpha$, the problem of defining a suitable crossed product $C^*$-algebra endowed with a spectral triple is addressed. The proposed…
In this note, first the Recurrent Variational Approach (RVA) is introduced by using as example a non-trivial spin-model, the spin-1/2 antiferromagnetic two-leg-ladder. Then, a first application of this scheme to the electronic structure of…
In this paper we introduce a class of polygonal complexes for which we can define a notion of sectional combinatorial curvature. These complexes can be viewed as generalizations of 2-dimensional Euclidean and hyperbolic buildings. We focus…
Our work is concerned with simplicial complexes that describe higher-order interactions in real complex systems. This description allows to go beyond the pairwise node-to-node representation that simple networks provide and to capture a…
We study limits of the largest connected components (viewed as metric spaces) obtained by critical percolation on uniformly chosen graphs and configuration models with heavy-tailed degrees. For rank-one inhomogeneous random graphs, such…
A fundamental way to study 3-manifolds is through the geometric lens, one of the most prominent geometries being the hyperbolic one. We focus on the computation of a complete hyperbolic structure on a connected orientable hyperbolic…
We provide multiple combinatorial expansion formulas - in terms of snake graphs, labelled posets, matrices, and $T$-walks - for elements in generalized cluster algebras associated to arcs on punctured orbifolds and illustrate their…
A $(d_1,d_2)$-biregular bipartite graph $G=(L\cup R,E)$ is called left-$(m,\delta)$ unique-neighbor expander iff each subset $S$ of the left vertices with $|S|\leq m$ has at least $\delta d_1|S|$ unique-neighbors, where unique-neighbors…
Incorporating social relations into the recommendation system, i.e. social recommendation, has been widely studied in academic and industrial communities. While many promising results have been achieved, existing methods mostly assume that…
Given a random 3-uniform hypergraph $H=H(n,p)$ on $n$ vertices where each triple independently appears with probability $p$, consider the following graph process. We start with the star $G_0$ on the same vertex set, containing all the edges…
Graph product structure theory expresses certain graphs as subgraphs of the strong product of much simpler graphs. In particular, an elegant formulation for the corresponding structural theorems involves the strong product of a path and of…