Related papers: Combinatorial generation via permutation languages…
For a connected graph, a path containing all vertices is known as \emph{Hamiltonian path}. For general graphs, there is no known necessary and sufficient condition for the existence of Hamiltonian paths and the complexity of finding a…
A barcode is a finite multiset of intervals on the real line. Jaramillo-Rodriguez (2023) previously defined a map from the space of barcodes with a fixed number of bars to a set of multipermutations, which presented new combinatorial…
In this paper, we provide a unified definition of mediated graph, a combinatorial structure with multiple applications in mathematical optimization. We study some geometric and algebraic properties of this family of graphs and analyze…
We give a new construction of a Hopf subalgebra of the Hopf algebra of Free quasi-symmetric functions whose bases are indexed by objects belonging to the Baxter combinatorial family (i.e. Baxter permutations, pairs of twin binary trees,…
We explore the combinatorial properties of the branching areas of execution paths in higher dimensional automata. Mathematically, this means that we investigate the combinatorics of the negative corner (or branching) homology of a globular…
We study the harmonic polytope, which arose in Ardila, Denham, and Huh's work on the Lagrangian geometry of matroids. We describe its combinatorial structure, showing that it is a $(2n-2)$-dimensional polytope with…
A hypertoric variety is a quaternionic analogue of a toric variety. Just as the topology of toric varieties is closely related to the combinatorics of polytopes, the topology of hypertoric varieties interacts richly with the combinatorics…
We develop a combinatorial model of the associated Hermite polynomials and their moments, and prove their orthogonality with a sign-reversing involution. We find combinatorial interpretations of the moments as complete matchings, connected…
An objective of the theory of combinatorial groupoids is to introduce concepts like "holonomy", "parallel transport", "bundles", "combinatorial curvature" etc. in the context of simplicial (polyhedral) complexes, posets, graphs, polytopes,…
The first paper in this series introduced a new approach to strong convergence of random matrices that is based primarily on soft arguments. This method was applied to achieve a refined qualitative and quantitative understanding of strong…
A simple convex polytope $P$ is \emph{cohomologically rigid} if its combinatorial structure is determined by the cohomology ring of a quasitoric manifold over $P$. Not every $P$ has this property, but some important polytopes such as…
We utilize degenerate perturbation theory to investigate continuous-time quantum search on second-order truncated simplex lattices. In this work, we show that the construction of the Hamiltonian must consider the structure of the lattice.…
We prove algorithmic weak and \Szemeredi{} regularity lemmas for several classes of sparse graphs in the literature, for which only weak regularity lemmas were previously known. These include core-dense graphs, low threshold rank graphs,…
With this work we aim to show how Mathematica can be a useful tool to investigate properties of combinatorial structures. Specifically, we will face enumeration problems on independent subsets of powers of paths and cycles, trying to…
We consider the problem of finding a Hamiltonian path with precedence constraints in the form of a partial order on the vertex set. This problem is known as Partially Ordered Hamiltonian Path Problem (POHPP). Here, we study the complexity…
Given a residually connected incidence geometry $\Gamma$ that satisfies two conditions, denoted $(B_1)$ and $(B_2)$, we construct a new geometry $H(\Gamma)$ with properties similar to those of $\Gamma$. This new geometry $H(\Gamma)$ is…
In this paper we report on results of our investigation into the algebraic structure supported by the combinatorial geometry of the cyclohedron. Our new graded algebra structures lie between two well known Hopf algebras: the…
In the early 1990's, Billera and Sturmfels introduced the monotone path polytope (MPP), a special case of the general theory of fiber polytopes that associates a polytope to a pair $(P,\varphi)$ of a polytope $P$ and linear functional…
Barnette's Conjecture claims that all cubic, 3-connected, planar, bipartite graphs are Hamiltonian. We give a translation of this conjecture into the matching-theoretic setting. This allows us to relax the requirement of planarity to give…
The algebras $\mathcal{L}_{g,n}(H)$ have been introduced by Alekseev-Grosse-Schomerus and Buffenoir-Roche in the middle of the 1990's, in the program of combinatorial quantization of the moduli space of flat connections over the surface…