Related papers: Fully Packed Loop configurations in a triangle
One-ports named "f-circuits", composed of similar conductors described by a monotonic polynomial, or quasi-polynomial (i.e. with positive but not necessarily integer, powers) characteristic i = f(v) are studied, focusing on the algebraic…
We calculate the probability that random polynomial matrices over a finite field with certain structures are right prime or left prime, respectively. In particular, we give an asymptotic formula for the probability that finitely many…
We consider the problem of packing fixed-length patterns into a permutation, and develop a connection between the number of large patterns and the number of bonds in a permutation. Improving upon a result of Kaplansky and Wolfowitz, we…
The Links-Quivers Correspondence predicts that all the symmetric (or antisymmetric) colored HOMFLY-PT polynomials of a link can be recovered from a finite amount of data (a quiver) associated to the link. We give a new geometric proof of…
Every maximum scattered linear set in $\mathrm{PG}(1,q^5)$ is the projection of an $\mathbb{F}_q$-subgeometry $\Sigma$ of $\mathrm{PG}(4,q^5)$ from a plane $\Gamma$ external to the secant variety to $\Sigma$. The pair $(\Gamma,\Sigma)$ will…
A fruitful approach to study stability of switched systems is to look for multiple Lyapunov functions. However, in general, we do not yet understand the interplay between the desired stability certificate, the template of the Lyapunov…
We introduce manifestly crossing-symmetric expansions for arbitrary systems of 1D CFT correlators. These expansions are given in terms of certain Polyakov blocks which we define and show how to compute efficiently. Equality of OPE and…
This is part of a series of papers describing the new curve integral formalism for scattering amplitudes of the colored scalar tr$\phi^3$ theory. We show that the curve integral manifests a very surprising fact about these amplitudes: the…
We prove that the exact crossing number of a graph can be efficiently computed for simple graphs having bounded vertex cover. In more precise words, Crossing Number is in FPT when parameterized by the vertex cover size. This is a notable…
We consider the statistical mechanics of a system of topologically linked polymers, such as for instance a dense solution of polymer rings. If the possible topological states of the system are distinguished using the Gauss linking number as…
We study well-posedness and long time behavior of the nonlinear Vlasov-Poisson- Fokker-Planck system with an external confining potential. The system describes the time evolution of particles (e.g.$\,\,$in a plasma) undergoing diffusion,…
Structured low-rank approximation is the problem of minimizing a weighted Frobenius distance to a given matrix among all matrices of fixed rank in a linear space of matrices. We study exact solutions to this problem by way of computational…
Graph products are characterized by the existence of non-trivial equivalence relations on the edge set of a graph that satisfy a so-called square property. We investigate here a generalization, termed RSP-relations. The class of graphs with…
Let $\mathfrak{P}$ be a topological property. We study the relation between the order structure of the set of all $\mathfrak{P}$-extensions of a completely regular space $X$ with compact remainder (partially ordered by the standard partial…
Clustering and closure coefficients are among the most widely applied indicators in the description of the topological structure of a network. Many distinct definitions have been proposed over time, particularly in the case of weighted…
We characterise rigid graphs for cylindrical normed spaces $Z=X\oplus_\infty \mathbb{R}$ where $X$ is a finite dimensional real normed linear space and $Z$ is endowed with the product norm. In particular, we obtain purely combinatorial…
We introduce a class of models of semiflexible polymers. The latter are characterized by a strong rigidity, the correlation length associated to the gradient-gradient correlations, called the persistence length, being of the same order as…
The present paper is devoted to studying of minimal parametric fillings of finite metric spaces (a version of optimal connection problem) by methods of Linear Programming. The estimate on the multiplicity of multi-tours appearing in the…
We describe the structure of the different hexagonal grids in dimension d=3, propose short notation for them, investigate the contact numbers of ball packings in these grids and share some computational results up to 200 balls, using mainly…
We prove the fractal crumpled structure of collapsed unknotted polymer ring. In this state the polymer chain forms a system of densely packed folds, mutually separated in all scales. The proof is based on the numerical and analytical…