Related papers: Hypergraphs and Lotka-Volterra systems with linear…
Our main result is a full classification, for every connected graph $H$, of the computational complexity of Steiner Forest on $H$-subgraph-free graphs. To obtain this dichotomy, we establish the following new algorithmic, hardness, and…
We prove that the saddle connection graph associated to any half-translation surface is 4-hyperbolic and uniformly quasi-isometric to the regular countably infinite-valent tree. Consequently, the saddle connection graph is not…
An $\omega$-tree-automatic structure is a relational structure whose domain and relations are accepted by Muller or Rabin tree automata. We investigate in this paper the isomorphism problem for $\omega$-tree-automatic structures. We prove…
Trigraph list homomorphism problems (also known as list matrix partition problems) have generated recent interest, partly because there are concrete problems that are not known to be polynomial time solvable or NP-complete. Thus while…
In this paper we derive new two-component integrable differential difference and partial difference systems by applying a Lax-Darboux scheme to an operator formed from an ${\mathfrak{sl}}_3({\mathbb{C}})$-based automorphic Lie algebra. The…
The mutually enriching relationship between graphs and matroids has motivated discoveries in both fields. In this paper, we exploit the similar relationship between embedded graphs and delta-matroids. There are well-known connections…
In this note, we investigate the tree pressure for multi-modal interval maps with a certain class of hyperbolic and non-exceptional upper semi-continuous functions. In particular, we obtain a generalized version of Corollary 2.2 in the…
We present an efficient algorithm for the construction of a holographic simple tree graph model that realizes a given entropy vector, subject to a specific ``chordality'' condition first introduced in arXiv:2412.18018. We further develop…
It is well known that every closure system can be represented by an implicational base, or by the set of its meet-irreducible elements. In Horn logic, these are respectively known as the Horn expressions and the characteristic models. In…
In the present paper we consider a discretization of hyperbolic systems of exponential type. We proved that, in the case of $2\times 2$ systems, the resulting semi-discrete system is Darboux integrable only if it corresponds to a Cartan…
We introduce an algorithm to find possible constants of motion for a given replicator equation. The algorithm is inspired by Dirac geometry and a Hamiltonian description for the replicator equations with such constants of motion, up to a…
We propose a scheme for nonlinearizing linear equations to generate integrable nonlinear systems of both the AKNS and the KN classes, based on the simple idea of dimensional analysis and detecting the building blocks of the Lax pair. Along…
The set of linear, differential operators preserving the vector space of couples of polynomials of degrees n and n-2 in one real variable leads to an abstract associative graded algebra A(2). The irreducible, finite dimensional…
Generalizing the notion of Newton polytope, we define the Newton-Okounkov body, respectively, for semigroups of integral points, graded algebras, and linear series on varieties. We prove that any semigroup in the lattice Z^n is…
We study homomorphism polynomials, which are polynomials that enumerate all homomorphisms from a pattern graph $H$ to $n$-vertex graphs. These polynomials have received a lot of attention recently for their crucial role in several new…
In this paper we give new requirements that a tree of $\delta$-hyperbolic spaces has to satisfy in order to be $\delta$-hyperbolic itself. As an application, we give a simple proof that limit groups are relatively hyperbolic.
A hypergraph is simple if it has no loops and no repeated edges, and a hypergraph is linear if it is simple and each pair of edges intersects in at most one vertex. For $n\geq 3$, let $r= r(n)\geq 3$ be an integer and let $\boldsymbol{k} =…
In this paper we examine the classes of graphs whose $K_n$-complements are trees and quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph $H$ of $K_n$, the $K_n$-complement of $H$ is the graph…
The family of 2-level matroids, that is, matroids whose base polytope is 2-level, has been recently studied and characterized by means of combinatorial properties. 2-level matroids generalize series-parallel graphs, which have been already…
We introduce a class of graphs with coloured edges to encode subsystems of the classical root systems, which in particular classify them up to equivalence. We further use the graphs to describe root-kernel intersections, as well as…