Related papers: Hypergraphs and Lotka-Volterra systems with linear…
A graph is k-linked if any k disjoint vertex-pairs can be joined by k disjoint paths. We improve a lower bound on the linkedness of polytopes slightly, which results in exact values for the minimal linkedness of 7-, 10- and 13-dimensional…
The purpose of this paper is to study the structure of Lotka-Volterra algebras, the set of their idempotent elements and their group of automorphisms. These algebras are defined through antisymmetric matrices and they emerge in connection…
We derive a variant of the loop-tree duality for Feynman integrals in the Schwinger parametric representation. This is achieved by decomposing the integration domain into a disjoint union of cells, one for each spanning tree of the graph…
The shrinking operation converts a hypergraph into a graph by choosing, from each hyperedge, two endvertices of a corresponding graph edge. A hypertree is a hypergraph which can be shrunk to a tree on the same vertex set. Klimo\v{s}ov\'{a}…
A rank one local system on the complement of a hyperplane arrangement is said to be admissible if it satisfies certain non-positivity condition at every resonant edges. It is known that the cohomology of admissible local system can be…
In a previous paper we derived equivalence relations for pseudo-Wronskian determinants of Hermite polynomials. In this paper we obtain the analogous result for Laguerre and Jacobi polynomials. The equivalence formulas are richer in this…
For an arbitrary valued field $(K,v)$ and a given extension $v(K^*)\hookrightarrow\Lambda$ of ordered groups, we analyze the structure of the tree formed by all $\Lambda$-valued extensions of $v$ to the polynomial ring $K[x]$. As an…
In this paper we construct a family of integrable reductions of the dressing chain, described in its Lotka-Volterra form. For each $k,n\in\mathbb N$ with $n\geqslant 2k+1$ we obtain a Lotka-Volterra system $\hbox{LV}_b(n,k)$ on $\mathbb…
For each uniformity $k \geq 3$, we construct $k$-uniform linear hypergraphs $G$ with arbitrarily large maximum degree $\Delta$ whose independence polynomial $Z_G$ has a root $\lambda$ with $\lvert\lambda\rvert = O\left(\frac{\log…
Assume that we embed the path $P_n$ as a subgraph of a $2$-dimensional grid, namely, $P_k \times P_l$. Given such an embedding, we consider the ordered set of subpaths $L_1, L_2, \ldots , L_m$ which are maximal straight segments in the…
A linear forest is a collection of vertex-disjoint paths. The Linear Arboricity Conjecture states that every graph of maximum degree $\Delta$ can be decomposed into at most $\lceil(\Delta+1)/2\rceil$ linear forests. We prove that $\Delta/2…
We show that the Looijenga--Lunts--Verbitsky Lie algebra acting on the cohomology of a hyperk\"ahler variety is a derived invariant, and obtain from this a number of consequences for the action on cohomology of derived equivalences between…
Sometimes a hyperbolic Kac-Moody algebra admits an automorphic correction, meaning a generalized Kac-Moody algebra with the same real simple roots and whose denominator function has good automorphic properties; these for example allow one…
For a nonautonomous linear system with nonuniform contraction, we construct a topological equivalence between this system and an unbounded nonlinear perturbation. This topological equivalence is constructed as a composition of…
We consider Legendrian contact structures on odd-dimensional complex analytic manifolds. We are particularly interested in integrable structures, which can be encoded by compatible complete systems of second order PDEs on a scalar function…
The inducibility of a graph represents its maximum density as an induced subgraph over all possible sequences of graphs of size growing to infinity. This invariant of graphs has been extensively studied since its introduction in $1975$ by…
A hypertree is a connected hypergraph without cycles. Further a hypertree is called an $r$-tree if, additionally, it is $r$-uniform. Note that 2-trees are just ordinary trees. A classical result states that for any 2-tree $T$ with…
We present a new formulation of the loop-tree duality theorem for higher loop diagrams valid both for massless and massive cases. $l$-loop integrals are expressed as weighted sum of trees obtained from cutting $l$ internal propagators of…
The existence of decompositions of the nonlinear integrable systems not only permits us to establish so-called linear superposition solutions but also to derive new nonlinear integrable coupled systems. Restricting our attention to the…
Classical (maximal) superintegrable systems in $n$ dimensions are Hamiltonian systems with $2n-1$ independent constants of the motion, globally defined, the maximum number possible. They are very special because they can be solved…