Related papers: Cycle algebras and polytopes of matroids
This article introduces the theory of Veronese polytopes, a broad generalisation of cyclic polytopes. These arise as convex hulls of points on curves with one or more connected components, obtained as the image of the rational normal curve…
We introduce the concept of minimum edge cover for an induced subgraph in a graph. Let $G$ be a unicyclic graph with a unique odd cycle and $I=I(G)$ be its edge ideal. We compute the exact values of all symbolic defects of $I$ using the…
Tropical polytopes are images of polytopes in an affine space over the Puiseux series field under the degree map. This viewpoint gives rise to a family of cellular resolutions of monomial ideals which generalize the hull complex of Bayer…
Unconditional polytopes are convex polytopes that are symmetric with respect to all coordinate hyperplanes and arise naturally from anti-blocking polytopes by reflection. This paper investigates algebraic relations between an anti-blocking…
Arithmetic combinatorics is often concerned with the problem of bounding the behaviour of arbitrary finite sets in a group or ring with respect to arithmetic operations such as addition or multiplication. Similarly, combinatorial geometry…
In this paper, we study a class of graph drawings that arise from bobbin lace patterns. The drawings are periodic and require a combinatorial embedding with specific properties which we outline and demonstrate can be verified in linear…
In part I of this work we studied the spaces of real algebraic cycles on a complex projective space P(V), where V carries a real structure, and completely determined their homotopy type. We also extended some functors in K-theory to…
A flat of a matroid is cyclic if it is a union of circuits. The cyclic flats of a matroid form a lattice under inclusion. We study these lattices and explore matroids from the perspective of cyclic flats. In particular, we show that every…
A seminal result by Whitney describes when two graphs have the same cycles. We consider the analogous problem for even cycle matroids. A representation of an even cycle matroid is a pair formed by a graph together with a special set of…
A classification is given for (regular) positions of direct sums of two matroid algebras (unital algebraic limits of matrix algebras) in a matroid superalgebra, where the individual summands have index 2 in their associated corner algebra.…
This paper extends the study of group algebras of finite groups in which the socle of the center is an ideal. We provide a detailed analysis of the structure of these groups. In a particular case, we reach a complete characterization of the…
We survey recent developments on rationality problems for algebraic varieties, with a particular emphasis on cycle-theoretic and combinatorial methods and their applications to hypersurfaces.
Neighborly polytopes are those that maximize the number of faces in each dimension among all polytopes with the same number of vertices. Despite their extremal properties they form a surprisingly rich class of polytopes, which has been…
Cycloids are particular Petri nets for modelling processes of actions or events. They belong to the fundaments of Petri's general systems theory and have very different interpretations, ranging from Einstein's relativity theory and…
Throughout our work on the L\^e cycles of an affine hypersurface singularity, our primary algebraic tool consisted of a method for taking the Jacobian ideal of a complex analytic function and decomposing it into pure-dimensional "pieces".…
We introduce a family of toric algebras defined by maximal chains of a finite distributive lattice. Applying results on stable set polytopes we conclude that every such algebra is normal and Cohen-Macaulay, and give an interpretation of its…
Circuits play a fundamental role in polyhedral theory and linear programming. For instance, circuits are used as step directions in various augmentation schemes for solving linear programs or to leave degenerate vertices while running the…
We borrow a classical construction from the study of rational billiards in dynamical systems known as the "unfolding construction" and show that it can be used to study the automorphism group of a Platonic surface. More precisely, the…
Rough set theory is a useful tool to deal with uncertain, granular and incomplete knowledge in information systems. And it is based on equivalence relations or partitions. Matroid theory is a structure that generalizes linear independence…
A classical problem in Distance Geometry, with multiple practical applications (in molecular structure determination, sensor network localization etc.) is to find the possible placements of the vertices of a graph with given edge lengths.…