Related papers: Invariant spanning trees for quadratic rational ma…
Let ${\mathbb F}_q$ be a finite field of characteristic two and ${\mathbb F}_q(X_1,...,X_n)$ a rational function field. We use matrix methods to obtain explicit transcendental bases of the invariant subfields of orthogonal groups and…
We consider the problem of uniformly generating a spanning tree, of a connected undirected graph. This process is useful to compute statistics, namely for phylogenetic trees. We describe a Markov chain for producing these trees. For cycle…
Spanning trees are fundamental for efficient communication in networks. For fault-tolerant communication, it is desirable to have multiple spanning trees to ensure resilience against failures of nodes and edges. To this end, various notions…
A metric phylogenetic tree relating a collection of taxa induces weighted rooted triples and weighted quartets for all subsets of three and four taxa, respectively. New intertaxon distances are defined that can be calculated from these…
A Gauss diagram is a simple, combinatorial way to present a knot. It is known that any Vassiliev invariant may be obtained from a Gauss diagram formula that involves counting (with signs and multiplicities) subdiagrams of certain…
Via correspondence theorems, rational log Gromov--Witten invariants of the plane can be computed in terms of tropical geometry. For many cases, there exists a range of algorithms to compute tropically: for instance, there are (generalized)…
Calculation of topological invariants for crystalline systems is well understood in reciprocal space, allowing for the topological classification of a wide spectrum of materials. In this work, we present a new technique based on the…
We introduce invariants of spatial graphs related to the Wu invariant and the Simon invariant, and apply them to prove that certain graphs are intrinsically chiral, and to obtain lower bounds for the minimal crossing number of embedded…
We consider the avoidance of patterns in inversion sequences that relate sorting via sorting machines including data structures such as pop stacks and stacks. Such machines have been studied under a variety of additional constraints and…
William Thurston (1946-2012) gave a combinatorial characterization for generic branched self-coverings of the two-sphere by associating a planar graph to them 10.48550/arXiv.1502.04760. By generalizing the notion of local balancing, the…
We propose an end-to-end deep learning learning model for graph classification and representation learning that is invariant to permutation of the nodes of the input graphs. We address the challenge of learning a fixed size graph…
We give a necessary condition for two diagrams of $3$-regular spatial graphs with the same underlying abstract graph $G$ to represent isotopic spatial graphs. The test works by reading off the writhes of the knot diagrams coming from a…
Chord diagrams and related enlacement graphs of alternating knots are enhanced to obtain complete invariant graphs including chirality detection. Moreover, the equivalence by common enlacement graph is specified and the neighborhood graph…
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
We prove a lower bound on the number of spanning two-forests in a graph, in terms of the number of vertices, edges, and spanning trees. This implies an upper bound on the average cut size of a random two-forest. The main tool is an identity…
We define an invariant of welded virtual knots from each finite crossed module by considering crossed module invariants of ribbon knotted surfaces which are naturally associated with them. We elucidate that the invariants obtained are non…
For each object in a tensor triangulated category, we construct a natural continuous map from the object's support---a closed subset of the category's triangular spectrum---to the Zariski spectrum of a certain commutative ring of…
We introduce new invariants of the projective plane (and, more generally, of certain toric surfaces) that arise from the appropriate enumeration of real elliptic curves. These invariants admit a refinement (according to the quantum index)…
We describe the multiplicative invariant algebras of the root lattices of all irreducible root systems under the action of the Weyl group. In each case, a finite system of fundamental invariants is determined and the class group of the…
We give two combinatorial proofs of an elegant product formula for the number of spanning trees of the $n$-dimensional hypercube. The first proof is based on the assertion that if one chooses a uniformly random rooted spanning tree of the…