Related papers: Non-Hamiltonian 2-regular Digraphs -- Residues
The purpose of the paper is to show that, in low dimensions, the WDVV equations are bi-Hamiltonian. The invariance of the bi-Hamiltonian formalism is proved for $N=3$. More examples in higher dimensions show that the result might hold in…
Given a closed, convex and pointed cone K in R^n, we present a result which infers K-irreducibility of sets of K-quasipositive matrices from strong connectedness of certain bipartite digraphs. The matrix-sets are defined via products, and…
The complete double vertex graph $M_2(G)$ of $G$ is defined as the graph whose vertices are the $2$-multisubsets of $V(G)$, and two of such vertices are adjacent in $M_2(G)$ if their symmetric difference (as multisets) is a pair of adjacent…
In this paper, we first present spectral conditions for the existence of $C_{n-1}$ in graphs (2-connected graphs) of order $n$, which are motivated by a conjecture of Erd\H{o}s. Then we prove spectral conditions for the existence of…
We construct a family of groups from suitable higher rank graphs which are analogues of the finite symmetric groups. We introduce homological invariants showing that many of our groups are, for example, not isomorphic to $nV$, when $n \geq…
We study set systems formed by neighborhoods in graphs of bounded twin-width. We start by proving that such graphs have linear neighborhood complexity, in analogy to previous results concerning graphs from classes with bounded expansion and…
In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…
Let D be the circulant digraph with n vertices and connection set {2,3,c}. (Assume D is loopless and has outdegree 3.) Work of S.C.Locke and D.Witte implies that if n is a multiple of 6, c is either (n/2) + 2 or (n/2) + 3, and c is even,…
We generalize the notion of an anomaly for a symmetry to a noninvertible symmetry enacted by surface operators using the framework of condensation in 2-categories. Given a multifusion 2-category, potentially with some additional levels of…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
Moving frames of various kinds are used to derive bi-Hamiltonian operators and associated hierarchies of multi-component soliton equations from group-invariant flows of non-stretching curves in constant curvature manifolds and Lie group…
We study the Harry Dym hierarchy of nonlinear evolution equations from the bi-Hamiltonian view point. This is done by using the concept of an S-hierarchy. It allows us to define a matrix Harry Dym hierarchy of commuting Hamiltonian flows in…
The computational cost of simulating quantum many-body systems can often be reduced by taking advantage of physical symmetries. While methods exist for specific symmetry classes, a general algorithm to find the full permutation symmetry…
The paper deals with the question of homometry in the dihedral groups $D_{n}$ of order $2n$. These groups have the specificity to be non-commutative. It leads to a new approach as compared as the one used in the traditional framework of the…
An out-(in-)branching B_s^+ (B_s^-) rooted at s in a digraph D is a connected spanning subdigraph of D in which every vertex x != s has precisely one arc entering (leaving) it and s has no arcs entering (leaving) it. We settle the…
We investigate polyhedral $2k$-manifolds as subcomplexes of the boundary complex of a regular polytope. We call such a subcomplex {\it $k$-Hamiltonian} if it contains the full $k$-skeleton of the polytope. Since the case of the cube is well…
A digraph is 2-regular if every vertex has both indegree and outdegree two. We define an embedding of a 2-regular digraph to be a 2-cell embedding of the underlying graph in a closed surface with the added property that for every…
We present a tight extremal threshold for the existence of Hamilton cycles in graphs with large minimum degree and without a large ``bipartite hole`` (two disjoint sets of vertices with no edges between them). This result extends Dirac's…
A graph is \emph{hamiltonian-connected} if every pair of vertices can be connected by a hamiltonian path, and it is \emph{hamiltonian} if it contains a hamiltonian cycle. We construct families of non-hamiltonian graphs for which the ratio…
The aim of this paper is to extend and generalise some work of Katona on the existence of perfect matchings or Hamilton cycles in graphs subject to certain constraints. The most general form of these constraints is that we are given a…