Related papers: Edgewise Cohen-Macaulay connectivity of partially …
Some well-known arithmetically Cohen-Macaulay configurations of linear varieties in $\mathbb{P}^r$ as $k$-configurations, partial intersections and star configurations are generalized by introducing tower schemes. Tower schemes are reduced…
The set of quasipositive surfaces is closed under incompressible inclusion. We prove that the induced order on fibre surfaces of positive braid links is almost a well-quasi-order. When restricting to quasipositive surfaces containing a…
Some basic mathematical tools such as convex sets, polytopes and combinatorial topology, are used quite heavily in applied fields such as geometric modeling, meshing, computer vision, medical imaging and robotics. This report may be viewed…
We introduce a new type of operad-like structure called a P-operad, which depends on the choice of some collection of posets P, and which is governed by chains in posets of P. We introduce several examples of such structures which are…
For any graded poset $P$, we define a new graded poset, $\mathcal E(P)$, whose elements are the edges in the Hasse diagram of P. For any group, $G$, acting on the boolean algebra, $B_n$, we conjecture that $\mathcal E(B_n/G)$ is Peck. We…
We consider partial matchings, which are finite graphs consisting of edges and vertices of degree zero or one. We consider transformations between two states of partial matchings. We introduce a method of presenting a transformation between…
We associate in a natural way to any partially ordered set $(P,\leq)$ a directed graph $E_P$ (where the vertices of $E_P$ correspond to the elements of $P$, and the edges of $E_P$ correspond to related pairs of elements of $P$), and then…
This paper is concerned with structures of general graphs with perfect matchings. We first reveal a partially ordered structure among factor-components of general graphs with perfect matchings. Our second result is a generalization of…
This paper examines the structure of poset matrices by formulating a set of new construction rules for this purpose. In this direction, the technique of partial composition operation will be introduced as the basis for the construction of…
We discuss a system of third order PDEs for strictly convex smooth functions on domains of Euclidean space. We argue that it may be understood as a closure of sorts of the first order prolongation of a family of second order PDEs. We…
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that their barycentric subdivisions are simplicial polytopes. The…
We study (a generalization of) the notion of linked determinantal loci recently introduced by the second author, showing that as with classical determinantal loci, they are Cohen-Macaulay whenever they have the expected codimension. We…
We initiate the study of convex geometry over ordered hyperfields. We define convex sets and halfspaces over ordered hyperfields, presenting structure theorems over hyperfields arising as quotients of fields. We prove hyperfield analogues…
Partially ordered groups, also known as po-groups, are groups with a compatible partial order. Results from M.I. Zajceva and H.-H. Teh are combined in order to provide a full characterisation of linear order extensions of a given order on a…
We define a poset of partitions associated to an operad. We prove that the operad is Koszul if and only if the poset is Cohen-Macaulay. In one hand, this characterisation allows us to compute the homology of the poset. This homology is…
The first steps towards linearisation of partial orders and equivalence relations are described. The definitions of partial orders and equivalence relations (on sets) are formulated in a way that is standard in category theory and that…
Optimizing an implicational base of a closure system consists in turning this implicational base into an equivalent one with premises and conclusions as small as possible. This task is known to be hard in general but tractable for a number…
We are interested in characterizing which classes of finite graphs are well-quasi-ordered by the induced subgraph relation. To that end, we devise an algorithm to decide whether a class of finite graphs well-quasi-ordered by the induced…
We provide a combinatorial recipe for constructing all posets of height at most two for which the corresponding type-A Lie poset algebra is contact. In the case that such posets are connected, a discrete Morse theory argument establishes…
Two lattice points are visible to one another if there exist no other lattice points on the line segment connecting them. In this paper we study convex lattice polygons that contain a lattice point such that all other lattice points in the…