Related papers: Left-cut-percolation and induced-Sidorenko bigraph…
An intersection digraph is a digraph where every vertex $v$ is represented by an ordered pair $(S_v, T_v)$ of sets such that there is an edge from $v$ to $w$ if and only if $S_v$ and $T_w$ intersect. An intersection digraph is reflexive if…
An oriented hypergraph is an oriented incidence structure that allows for the generalization of graph theoretic concepts to integer matrices through its locally signed graphic substructure. The locally graphic behaviors are formalized in…
Let $\mathfrak{g}$ be a simple Lie algebra: its dual space $\mathfrak{g}^*$ is a Poisson variety. It is well known that for each nilpotent element $f$ in $\mathfrak{g}$, it is possible to construct a new Poisson structure by Hamiltonian…
This paper explores the structure of graphs defined by an excluded minor or an excluded odd minor through the lens of graph products and tree-decompositions. We prove that every graph excluding a fixed odd minor is contained in the strong…
Classical molecular-dynamics simulations have been carried out to investigate densification mechanisms in silicon dioxide thin films deposited on an amorphous silica surface, according to a simplified ion-beam assisted deposition (IBAD)…
We prove that if a graph has a tree-decomposition of width at most w, then it has a tree-decomposition of width at most w with certain desirable properties. We will use this result in a subsequent paper to show that every 2-connected graph…
If a complex $X$ is a subcomplex of a diagrammatically reducible 2-complex $Y$ that has locally indicable fundamental group, then $X$ has locally indicable fundamental group. This is a consequence of the Corson-Trace characterization of…
Klimo\v{s}ov\'a, Piguet, and Rozho\v{n} conjectured that any graph with minimum degree $k/2$ and sufficiently many vertices of degree $k$ should contain all trees with $k$ edges. We prove an asymptotic version of this conjecture for dense…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
The symmetric algebra $S(\mathfrak g)$ of a reductive Lie algebra $\mathfrak g$ is equipped with the standard Poisson structure, i.e., the Lie-Poisson bracket. Poisson-commutative subalgebras of $S(\mathfrak g)$ attract a great deal of…
We consider diffeomorphisms of compact Riemmanian manifolds which have a Gibbs-Markov-Young structures, consisting of a reference set $\Lambda$ with a hyperbolic product structure and a countable Markov partition. We assume polynomial…
Directed cographs (di-cographs) play a crucial role in the reconstruction of evolutionary histories of genes based on homology relations which are binary relations between genes. A variety of methods based on pairwise sequence comparisons…
A di-sk tree is a rooted binary tree whose nodes are labeled by $\oplus$ or $\ominus$, and no node has the same label as its right child. The di-sk trees are in natural bijection with separable permutations. We construct a combinatorial…
Given a graph $G$, we define ${\bf bcg}(G)$ as the minimum $k$ for which $G$ can be contracted to the uniformly triangulated grid $\Gamma_{k}$. A graph class ${\cal G}$ has the SQG${\bf C}$ property if every graph $G\in{\cal G}$ has…
Let $\varPhi$ be a root system of a finite Weyl group $W$ with simple roots $\Delta$ and corresponding simple reflections $S$. For $J \subseteq S$, denote by $W_J$ the standard parabolic subgroup of $W$ generated by $J$, and by $\Delta_J…
A structure is called homogeneous if every isomorphism between finitely induced substructures of the structure extends to an automorphism of the structure. Recently, P. J. Cameron and J. Ne\v{s}et\v{r}il introduced a relaxed version of…
This paper gives a complete classification of linear repetitivity (LR) for a natural class of aperiodic Euclidean cut and project schemes with convex polytopal windows. Our results cover those cut and project schemes for which the lattice…
A minimum dominating set for a digraph (directed graph) is a smallest set of vertices such that each vertex either belongs to this set or has at least one parent vertex in this set. We solve this hard combinatorial optimization problem…
Integrable deformations of a class of Rikitake dynamical systems are constructed by deforming their underlying Lie-Poisson Hamiltonian structures, which are considered linearizations of Poisson--Lie structures on certain (dual) Lie groups.…
Finite digraphs $R$ and $S$ are studied with $\# {\cal H}(G,R) \leq \# {\cal H}(G,S)$ for every finite digraph $G \in \mathfrak{ D }'$, where ${\cal H}(G,H)$ is the set of order homomorphisms from $G$ to $H$ and $\mathfrak{ D }'$ is a class…