Related papers: A geometric approach to acyclic orientations
An LR-structure is a tetravalent vertex-transitive graph together with a special type of a decomposition of its edge-set into cycles. LR-structures were introduced in a paper by P. Poto\v{c}nik and S. Wilson, titled `Linking rings…
A theorem of Kontsevich relates the homology of certain infinite dimensional Lie algebras to graph homology. We formulate this theorem using the language of reversible operads and mated species. All ideas are explained using a pictorial…
Building sets were introduced in the study of wonderful compactifications of hyperplane arrangement complements and were later generalized to finite meet-semilattices. Convex geometries, the duals of antimatroids, offer a robust…
We prove that the set of orthogonal separable coordinates on an arbitrary (pseudo-)Riemannian manifold carries a natural structure of a projective variety, equipped with an action of the isometry group. This leads us to propose a new,…
Supercyclides are surfaces with a characteristic conjugate parametrization consisting of two families of conics. Patches of supercyclides can be adapted to a Q-net (a discrete quadrilateral net with planar faces) such that neighboring…
In this paper we present a method for finding the absorbing radical of a finite-dimensional evolution algebra. Such a method consists of finding the acyclic vertices of an oriented graph associated with the algebra. The set of generators…
We prove that the Leibniz PROP is isomorphic (as $\Bbbk$-linear categories) to the symmetric crossed presimplicial algebra $\Bbbk[(\Delta^+)^{op} \mathbb{S}]$ where $\Delta^+$ is the skeletal category of finite well-ordered sets with…
Given a finite directed acyclic graph, the space of non-negative unit flows is a lattice polytope called the flow polytope of the graph. We consider the volumes of flow polytopes for directed acyclic graphs on $n+1$ vertices with a fixed…
Given a poset $P$ with at least two elements and a group $G$, there exists a selfdual lattice of length 16 such that the collection of its principal congruences is order isomorphic to $P$ while its automorphism group to $G$.
Without imposing restrictions on a weighted graph's arc lengths, symmetry structures cannot be expected. But, they exist. To find them, the graphs are decomposed into a component that dictates all closed path properties (e.g., shortest and…
We give a self-contained introduction to the theory of secondary polytopes and geometric bistellar flips in triangulations of polytopes and point sets, as well as a review of some of the known results and connections to algebraic geometry,…
In this paper, we survey constructions of and nonexistence results on combinatorial/geometric structures which arise from unions of cyclotomic classes of finite fields. In particular, we survey both classical and recent results on…
We numerically demonstrate bidirectional sorting of flocking particles interacting with an array of asymmetric barriers. Each particle aligns with the average swimming direction of its neighbors according to the Vicsek model and experiences…
Let $\mathcal{G}$ be the set of all connected graphs on vertex set $[n]$. Define the partial ordering $<$ on $\mathcal{G}$ as follows: for $G,H\in \mathcal{G}$ let $G<H$ if $E(G)\subset E(H)$. The poset $(\mathcal{G},<)$ is graded, each…
Canonical extension of finitary ordered structures such as lattices, posets, proximity lattices, etc., is a certain completion which entirely describes the topological dual of the ordered structure and it does so in a purely algebraic and…
For a symmetric 2t-cycle in the tope graph of a simple oriented matroid M on the ground set {1,...,t}, where t is even, we describe decompositions of topes and subtopes of M with respect to the subtopes corresponding to the edges of the…
Let A be a unital C*-algebra. Denote by P the space of selfadjoint projections of A. We study the relationship between P and the spaces of projections P_a determined by the different involutions #_a induced by positive invertible elements a…
We discuss the problem on the connectedness of various webs of lattice polytopes by introducing a geometric point of view from the toric Mori theory. To this end, we provide a combinatorial description of toric Sarkisov links in terms of…
Network models with latent geometry have been used successfully in many applications in network science and other disciplines, yet it is usually impossible to tell if a given real network is geometric, meaning if it is a typical element in…
We define toric partial orders, corresponding to regions of graphic toric hyperplane arrangements, just as ordinary partial orders correspond to regions of graphic hyperplane arrangements. Combinatorially, toric posets correspond to finite…