Related papers: Incidence combinatorics of resolutions
We introduce combinatorial multivector fields, associate with them multivalued dynamics and study their topological features. Our combinatorial multivector fields generalize combinatorial vector fields of Forman. We define isolated…
Given a symmetric monoidal category $C$ with product $\sqcup$, where the neutral element for the product is an initial object, we consider the poset of $\sqcup$-complemented subobjects of a given object $X$. When this poset has finite…
Nested parentheses are forms in an algebra which define orders of evaluations. A class of well-formed sets of associated opening and closing parentheses is well studied in conjunction with Dyck paths and Catalan numbers. Nested parentheses…
We introduce in this section an Algebraic and Combinatorial approach to the theory of Numbers. The approach rests on the observation that numbers can be identified with familiar combinatorial objects namely rooted trees, which we shall here…
We adapt methods coming from additive combinatorics in groups to the study of linear span in associative unital algebras. In particular, we establish for these algebras analogues of Diderrich-Kneser's and Hamidoune's theorems on sumsets and…
Drawing parallels with hyperplane arrangements, we develop the theory of arrangements of submanifolds. Given a smooth, finite dimensional, real manifold $X$ we consider a finite collection $\mathcal{A}$ of locally flat, codimension-1…
We study the combinatorics of hyperplane arrangements over arbitrary fields. Specifically, we determine in which situation an arrangement and its reduction modulo a prime number have isomorphic lattices via the use of minimal strong…
In the present work, we propose a new set of coherent structures that arise in nonlinear dynamical lattices with more than one components, namely interlaced solitons. These are waveforms in which in the relevant anti-continuum limit, i.e.…
Monotone polytopes, also known as smooth reflexive polytopes, are the polytopes associated to monotone symplectic toric manifolds and Gorenstein Fano toric varieties. We first show that the only monotone polytopes admitting blow-ups at…
It is well known that not every combinatorial configuration admits a geometric realization with points and lines. Moreover, some of them do not even admit realizations with pseudoline arrangements, i.e., they are not topological. In this…
How much of the combinatorial structure of a pointed polyhedron is contained in its vertex-facet incidences? Not too much, in general, as we demonstrate by examples. However, one can tell from the incidence data whether the polyhedron is…
Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…
We show that iterating Nash blowups resolve the singularities of normal toric surfaces satisfying the following property: the minimal generating set of the corresponding semigroup is contained in one or two segments. We also provide…
In order to understand the parameter space of monic and centered complex polynomial vector fields of degree d in the complex plane, decomposed by the combinatorial classes of the vector fields, it is interesting to know the number of loci…
We consider nonlinear recurrences generated from the iteration of maps that arise from cluster algebras. More precisely, starting from a skew-symmetric integer matrix, or its corresponding quiver, one can define a set of mutation…
We introduce $\delta$-cliffs, a generalization of permutations and increasing trees depending on a range map $\delta$. We define a first lattice structure on these objects and we establish general results about its subposets. Among them, we…
This paper considers the difficulty in the set-system approach to generalizing graph theory. These difficulties arise categorically as the category of set-system hypergraphs is shown not to be cartesian closed and lacks enough projective…
We derive a series of results on random walks on a d-dimensional hypercubic lattice (lattice paths). We introduce the notions of terse and simple paths corresponding to the path having no backtracking parts (spikes). These paths label…
In order to be able to use methods of Universal Algebra for investigating posets, we assign to every pseudocomplemented poset, to every relatively pseudocomplemented poset and to every sectionally pseudocomplemented poset a certain algebra…
We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or,…