Related papers: Khintchine inequalities, trace monoids and Tur\'an…

We study $k$-point correlators of characteristic polynomials in non-Hermitian ensembles of random matrices, focusing on the real, complex and quaternion $N \times N$ Ginibre ensembles. Our approach is based on the technique of character…

We construct quantum K-invariants in non-archimedean analytic geometry. Contrary to the classical approach in algebraic geometry via perfect obstruction theory, we build on our previous works on the foundations of derived non-archimedean…

We study solutions to the multi-marginal Monge-Kantorovich problem which are concentrated on several graphs over the first marginal. We first present two general conditions on the cost function which ensure, respectively, that any solution…

We establish a central limit theorem for the sum of $\epsilon$-independent random variables, extending both the classical and free probability setting. Central to our approach is the use of graphon limits to characterize the limiting…

We present a theoretical framework for the analysis of amplitude transfer in Quantum Variational Algorithms (QVAs) for combinatorial optimisation with mixing unitaries defined by vertex-transitive graphs, based on their continuous-time…

A classical result of Nosal asserts that every $m$-edge graph with spectral radius $\lambda (G)> \sqrt{m}$ contains a triangle. A celebrated extension of Nikiforov [35] states that if $G$ is an $m$-edge graph with $\lambda (G)> \sqrt{(1-…

A geometric setup for constrained variational calculus is presented. The analysis deals with the study of the extremals of an action functional defined on piecewise differentiable curves, subject to differentiable, non-holonomic…

A classical extremal, or Tur\'an-type problem asks to determine ${\rm ex}(G, H)$, the largest number of edges in a subgraph of a graph $G$ which does not contain a subgraph isomorphic to $H$. Alon and Shikhelman introduced the so-called…

In this note, we show that the norm of an $n\times n$ random jointly exchangeable matrix with zero diagonal can be estimated in terms of the norm of its $n/2\times n/2$ submatrix located in the top right corner. As a consequence, we prove a…

By using combinatorics, we give a new proof for the recurrence relations of the characteristic polynomial coefficients, and then we obtain an explicit expression for the generic term of the coefficient sequence, which yields the trace…

We develop a new analytic method for quantitative mixing of automorphisms on nilmanifolds. The method is based on the introduction and solvability of \emph{multiple fractional cohomological equations of Type~$I$} (sum type). We prove that…

For positive integers $s,t,r$, let $K_{s,t}^{(r)}$ denote the $r$-uniform hypergraph whose vertex set is the union of pairwise disjoint sets $X,Y_1,\dots,Y_t$, where $|X| = s$ and $|Y_1| = \dots = |Y_t| = r-1$, and whose edge set is…

To every directed graph $E$ one can associate a \emph{graph inverse semigroup} $G(E)$, where elements roughly correspond to possible paths in $E$. These semigroups generalize polycylic monoids, and they arise in the study of Leavitt path…

The main result of the paper is motivated by the following two, apparently unrelated graph optimization problems: (A) as an extension of Edmonds' disjoint branchings theorem, characterize digraphs comprising $k$ disjoint branchings $B_i$…

A non-autonomous version of the standard map with a periodic variation of the parameter is introduced and studied. Symmetry properties in the variables and parameters of the map are found and used to find relations between rotation numbers…

We consider a particular class of equations of motion, generalizing to n degrees of freedom the "dissipative spin--orbit problem", commonly studied in Celestial Mechanics. Those equations are formulated in a pseudo-Hamiltonian framework…

We consider the universality for the trace invariants of $c_1 N \times \cdots \times c_D N$ tensors with i.i.d. complex random elements. In the case $c_1 = \cdots = c_D$, Gurau derived the universality in the limit $N \to \infty$ by…

The oriented Tur\'{a}n number of a given oriented graph $\overrightarrow{F}$, denoted by $\exo(n,\overrightarrow{F})$, is the largest number of arcs in $n$-vertex $\overrightarrow{F}$-free oriented graphs. This parameter could be seen as a…

For two graphs $G$ and $H$, the Tur\'{a}n number $ex(G,H)$ is the maximum number of edges in a subgraph of $G$ that contains no copy of $H$. Chen, Li, and Tu determined the Tur\'{a}n numbers $ex(K_{m,n},kK_2)$ for all $k\geq 1$ [7]. In this…

This paper is motivated by the question of how global and dense restriction sets in results from extremal combinatorics can be replaced by less global and sparser ones. The result we consider here as an example is Turan's theorem, which…