Related papers: Deletion theorem and combinatorics of hyperplane a…
A discriminantal hyperplane arrangement B(n,k,A) is constructed from a given (generic) hyperplane arrangement A, which is classified as either very generic or non-very generic depending on the combinatorial structure of B(n,k,A). In…
We study the structure of the set of all possible affine hyperplane sections of a convex polytope. We present two different cell decompositions of this set, induced by hyperplane arrangements. Using our decomposition, we bound the number of…
We extend Kolchin's results on linear dependence over projective varieties in the constants, to linear dependence over arbitrary complete differential varieties. We show that in this more general setting, the notion of linear dependence…
Cut-elimination theorems constitute one of the most important classes of theorems of proof theory. Since Gentzen's proof of the cut-elimination theorem for the system $\mathbf{LK}$, several other proofs have been proposed. Even though the…
When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…
The reflection arrangement of a Coxeter group is a well known instance of a free hyperplane arrangement. In 2002, Terao showed that equipped with a constant multiplicity each such reflection arrangement gives rise to a free…
We study the interaction between two structures on the group of polynomial automorphisms of the affine plane: its structure as an amalgamated free product and as an infinite-dimensional algebraic variety. We introduce a new conjecture, and…
Let $R=\Bbbk [x_1,..., x_m]$ be a polynomial ring in $m$ variables over $\Bbbk$ with the standard $\mathbb{Z}^m$ grading and $L$ a multigraded Noetherian $R$-module. When $\Bbbk$ is a field, Tchernev has an explicit construction of a…
This paper illustrates the combinatorial approach to vertex algebra - study of vertex algebras presented by generators and relations. A necessary ingredient of this method is the notion of free vertex algebra. Borcherds \cite{bor} was the…
We define arrangements of codimension-1 submanifolds in a smooth manifold which generalize arrangements of hyperplanes. When these submanifolds are removed the manifold breaks up into regions, each of which is homeomorphic to an open disc.…
The study proves the existence of an algorithm to receive all elements of a class of binary matrices without obtaining redundant elements, e. g. without obtaining binary matrices that do not belong to the class. This makes it possible to…
We prove a general decomposition theorem for the modal $\mu$-calculus $L_\mu$ in the spirit of Feferman and Vaught's theorem for disjoint unions. In particular, we show that if a structure (i.e., transition system) is composed of two…
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
The classical Bertini theorem on generic intersection of an algebraic set with hyperplanes states the following: \emph{Let X be a nonsingular closed subvariety of $\mathbb{P}^n_k$, where $k$ is an algebraically closed field. Then there…
Suppose that W is a finite, unitary reflection group acting on the complex vector space V. Let A = A(W) be the associated hyperplane arrangement of W. Terao has shown that each such reflection arrangement A is free. There is the stronger…
We derive new bounds of the remainder in a combinatorial central limit theorem without assumptions on independence and existence of moments of summands. For independent random variables our theorems imply Esseen and Berry-Esseen type…
A distributive lattice structure ${\mathbf M}(G)$ has been established on the set of perfect matchings of a plane bipartite graph $G$. We call a lattice {\em matchable distributive lattice} (simply MDL) if it is isomorphic to such a…
In this work we study line arrangements consisting in lines passing through three non-aligned points. We call them triangular arrangements. We prove that any combinatorics of a triangular arrangement is always realized by a…
Let $\mathcal{A}$ be a real line arrangement and $\mathcal{D}(\mathcal{A})$ the module of $\mathcal{A}$-derivations view as the set of polynomial vector fields which possess $\mathcal{A}$ as an invariant set. We first characterize…
This paper considers a framework for combinatorial variants of perpetual-scheduling problems. Given an independence system $(E,\mathcal{I})$, a schedule consists of an independent set $I_t \in \mathcal{I}$ for every time step $t \in…