Related papers: Tridiagonalized GUE matrices are a matrix model fo…
Embedded random matrix ensembles are generic models for describing statistical properties of finite isolated quantum many-particle systems. For the simplest spinless fermion (or boson) systems with say $m$ fermions (or bosons) in $N$ single…
The modular decomposition of a graph $G$ is a natural construction to capture key features of $G$ in terms of a labeled tree $(T,t)$ whose vertices are labeled as "series" ($1$), "parallel" ($0$) or "prime". However, full information of $G$…
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…
In many longitudinal settings, economic theory does not guide practitioners on the type of restrictions that must be imposed to solve the rotational indeterminacy of factor-augmented linear models. We study this problem and offer several…
A generalization of the random geometric graph (RGG) model is proposed by considering a set of points uniformly and independently distributed on a rectangle of unit area instead of on a unit square [0,1]^2. The topological properties of the…
For every physical model defined on a generic graph or factor graph, the Bethe $M$-layer construction allows building a different model for which the Bethe approximation is exact in the large $M$ limit and it coincides with the original…
Using parametrized curves (Section 1) or parametrized sheets (Section 3), and suitable metrics, we treat the jet bundle of order one as a semi-Riemann manifold. This point of view allows the description of solutions of DEs as pregeodesics…
We obtain explicit formulas for the enumeration of labelled parallelogram polyominoes. These are the polyominoes that are bounded, above and below, by north-east lattice paths going from the origin to a point (k,n). The numbers from 1 and n…
A set of vertices of a graph $G$ such that each vertex of $G$ is either in the set or is adjacent to a vertex in the set is called a dominating set of $G$. If additionally, the set of vertices induces a connected subgraph of $G$ then the…
We propose and study a new semi-random semi-adversarial model for Balanced Cut, a planted model with permutation-invariant random edges (PIE). Our model is much more general than planted models considered previously. Consider a set of…
We add to Galilean symmetries the transformations describing constant accelerations. The corresponding extended Galilean algebra allows, in any dimension $D=d+1$, the introduction of one central charge $c$ while in $D=2+1$ we can have three…
We define a bar construction endofunctor on the category of commutative augmented monoids $A$ of a symmetric monoidal category $\mathcal{V}$ endowed with a left adjoint monoidal functor $F:s\mathbf{Set}\to \mathcal{V}$. To do this, we need…
A method of classification of integrable equations on quad-graphs is discussed based on algebraic ideas. We assign a Lie ring to the equation and study the function describing the dimensions of linear spaces spanned by multiple commutators…
We discuss a generic model of Bayesian inference with binary variables defined on edges of a planar graph. The Loop Calculus approach of [1, 2] is used to evaluate the resulting series expansion for the partition function. We show that, for…
The generalized Langevin equation (GLE) is a useful framework for analyzing and modeling the dynamics of many-body systems in terms of low-dimensional reaction coordinates, with its specific form determined by the choice of projection…
We propose a family of multivariate Gaussian process models for correlated outputs, based on assuming that the likelihood function takes the generic form of the multivariate exponential family distribution (EFD). We denote this model as a…
We present a class of classically marginal N-vector models in d=4 and d=3, whose scalar potentials can be written as subdeterminants of symmetric matrices. The d=3 case is a generalization of the scalar Bagger-Lambert-Gustavsson (BLG)…
Mayer cluster expansion is an important tool in statistical physics to evaluate grand canonical partition functions. It has recently been applied to the Nekrasov instanton partition function of $\mathcal{N}=2$ 4d gauge theories. The…
We study scalar products of Bethe vectors in the models solvable by the nested algebraic Bethe ansatz and described by $\mathfrak{gl}(m|n)$ superalgebra. Using coproduct properties of the Bethe vectors we obtain a sum formula for their…
Let $G$ be a graph. Assume that to each vertex of a set of vertices $S\subseteq V(G)$ a robot is assigned. At each stage one robot can move to a neighbouring vertex. Then $S$ is a mobile general position set of $G$ if there exists a…