Related papers: Incidence combinatorics of resolutions
Mixed superposition rules are, in short, a method to describe the general solutions of a time-dependent system of first-order differential equations, a so-called Lie system, in terms of particular solutions of other ones. This article is…
This paper presents a unified framework for determining the congruences on a number of monoids and categories of transformations, diagrams, matrices and braids, and on all their ideals. The key theoretical advances present an iterative…
Aggregation processes in systems of planar macromolecules and colloids drive a broad range of phenomena in natural systems and soft materials. Depending on chemical architecture, intermolecular interactions in these systems may favor…
We introduce a new family of hyperplane arrangements inspired by the homogenized Linial arrangement (which was recently introduced by Hetyei), and show that the intersection lattices of these arrangements are isomorphic to the bond lattices…
In this paper we establish a new connection between central sets and the strong coincidence conjecture for fixed points of irreducible primitive substitutions of Pisot type. Central sets, first introduced by Furstenberg using notions from…
Recent progress in time-series forecasting has led to rapidly increasing architectural complexity, yet many reported State-of-the-Art gains are statistically fragile or misattributed. We argue that progress requires a shift from model…
We introduce decomposition complexes of posets, which generalize order complexes. The main advantage of our construction is that decomposition complexes are closed under taking products. Other special instances of this theory include nested…
We review aspects of an important paper by Robert Strichartz concerning reverse iterated function systems (i.f.s.) and fractal blowups. We compare the invariant sets of reverse i.f.s. with those of more standard i.f.s. and with those of…
The purpose of this note is to give an exposition of some interesting combinatorics and convex geometry concepts that appear in algebraic geometry in relation to counting the number of solutions of a system of polynomial equations in…
On complex algebraic varieties, height functions arising in combinatorial applications fail to be proper. This complicates the description and computation via Morse theory of key topological invariants. Here we establish checkable…
In this work, we consider the singular set in the thin obstacle problem with weight $|x_{n+1}|^a$ for $a\in (-1, 1)$, which arises as the local extension of the obstacle problem for the fractional Laplacian (a non-local problem). We develop…
Can you decide if there is a coincidence in the numbers counting two different combinatorial objects? For example, can you decide if two regions in $\mathbb{R}^3$ have the same number of domino tilings? There are two versions of the…
From a group action on a space, define a variant of the configuration space by insisting that no two points inhabit the same orbit. When the action is almost free, this "orbit configuration space" is the complement of an arrangement of…
Dendriform structures arise naturally in algebraic combinatorics (where they allow, for example, the splitting of the shuffle product into two pieces) and through Rota-Baxter algebra structures (the latter appear, among others, in…
In this paper we provide a preliminary investigation of subclasses of bounded posets with antitone involution which are "pastings" of their maximal Kleene sub-lattices. Specifically, we introduce super-paraorthomodular lattices, namely…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
Let S, T be surfaces in P3. Suppose that S intersect T is set-theoretically a smooth curve C of degree d and genus g. Suppose that S and T have no common singular points. Then if C is not a complete intersection, then deg(S), deg(T) < 2d^4.…
We study combinatorial structures arising from finite-time transition probabilities of the Totally Asymmetric Simple Exclusion Process with open boundary conditions. While much of the existing combinatorial theory regarding the TASEP…
This thesis opens with an introductory discussion, where the reader is gently led to the world of topological combinatorics, and, where the results of this Habilitationsschrift are portrayed against the backdrop of the broader philosophy of…
We introduce a new combinatorial invariant, which we call crosscut poset, that is finer than the crosscut complex. We exhibit many applications of the crosscut poset which include a generalization of Bj\"orner's crosscut theorem and two…