Related papers: Quantitative combinatorial geometry for continuous…
We have recently proposed arXiv:2105.11565 a powerful method for computing group factors of the perturbative series expansion of the Wilson loop in the Chern-Simons theory with $SU(N)$ gauge group. In this paper, we apply the developed…
We prove a quantitative version of the multi-colored Motzkin-Rabin theorem in the spirit of [BDWY12]: Let $V_1,\ldots,V_n \subset R^d$ be $n$ disjoint sets of points (of $n$ `colors'). Suppose that for every $V_i$ and every point $v \in…
In this paper, we present some results related to Barany-Larman colored problem and The Zivaljevic and Vrecica colored Tverberg problem. We give an alternative proof for the Barany-Larman Conjecture for primes -1 and the optimal colored…
The present paper studies a quantitative version of the transversality theorem. More precisely, given a continuous function $g\in \mathcal{C}([0,1]^d,\mathbb{R}^m)$ and a global smooth manifold $W\subset \mathbb{R}^m$ of dimension $p$, we…
We extend results of parametric geometry of numbers to a general diagonal flow on the space of lattices. Moreover, we compute the Hausdorff dimension of the set of trajectories with every given behavior, with respect to a nonstandard metric…
We prove analogues for hypergraphs of Szemer\'edi's regularity lemma and the associated counting lemma for graphs. As an application, we give the first combinatorial proof of the multidimensional Szemer\'edi theorem of Furstenberg and…
We derive and analyze three feature map representations of parametrized quantum dynamics, which generalize variational quantum circuits. These are (i) a Lie-Fourier partial sum, (ii) a Taylor expansion, and (iii) a finite-dimensional sinc…
Given a fixed integer $n$, we prove Ramsey-type theorems for the classes of all finite ordered $n$-colorable graphs, finite $n$-colorable graphs, finite ordered $n$-chromatic graphs, and finite $n$-chromatic graphs.
In this paper we continue the investigation of Loday's Leibniz cohomology as a new invariant for differentiable manifolds. In particular the Leibniz coboundary of a k-tensor (in the sense of differential geometry) is computed in a local…
Regular variation is a continuous-parameter theory; we work in a general setting, containing the existing Karamata, Bojanic-Karamata/de Haan and Beurling theories as special cases. We give sequential versions of the main theorems, that is,…
Quantum geometry has emerged as a central and ubiquitous concept in quantum sciences, with direct consequences on quantum metrology and many-body quantum physics. In this context, two fundamental geometric quantities are known to play…
We apply Cauchy's interlacing theorem to derive some eigenvalue bounds to the chromatic number using the normalized Laplacian matrix, including a combinatorial characterization of when equality occurs. Further, we introduce some new…
We study multi-parameter Carnot-Caratheodory balls, generalizing results due to Nagel, Stein, and Wainger in the single parameter setting. The main technical result is seen as a uniform version of the theorem of Frobenius. In addition, we…
The Carath\'eodory theorem on the construction of a measure is generalized by replacing the outer measure with an approximation of it and generalizing the Carath\'eodory measurability. The new theorem is applied to obtain dynamically…
We propose a notion of graph convergence that interpolates between the Benjamini--Schramm convergence of bounded degree graphs and the dense graph convergence developed by L\'aszl\'o Lov\'asz and his coauthors. We prove that spectra of…
We consider colored compositions where only some parts are allowed different colors, depending on their locations in the composition. The counting sequences are obtained through generating functions. Connections to many other combinatorial…
We prove a version of the strong Taylor's conjecture for stable graphs: if $G$ is a stable graph whose chromatic number is strictly greater than $\beth_2(\aleph_0)$ then $G$ contains all finite subgraphs of Sh$_n(\omega)$ and thus has…
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…
We introduce a new combinatorial abstraction for the graphs of polyhedra. The new abstraction is a flexible framework defined by combinatorial properties, with each collection of properties taken providing a variant for studying the…
The aim of this note is twofold. On the one hand, we present a streamlined version of Molloy's new proof of the bound $\chi(G) \leq (1+o(1))\Delta(G)/\ln \Delta(G)$ for triangle-free graphs $G$, avoiding the technicalities of the entropy…