Related papers: Configurations related to combinatorial Veronesian…
We investigate the poset of skew diagrams ordered by adding or forming the union of skew diagrams. We will show that a skew diagram which has at least n convex corners to the upper left and also to the lower right is larger than the skew…
We develop certain combinatorial tools for the study of discriminants of general systems of polynomial equations. Applying these tools in a sequel paper, we completely classify components of such discriminants, generalizing the classical…
Let $M$ be a subset of vector space or projective space. The authors define the \emph{generalized configuration space} of $M$ which is formed by $n$-tuples of elements of $M$ where any $k$ elements of each $n$-tuple are linearly…
We give a general method to build categories of combinatorial manifolds, i.e. categories of combinatorial objects satisfying some local property at every "point", as coreflective subcategories of categories of relational presheaves. To do…
For an integer $m\geq 1$, a combinatorial manifold $\widetilde{M}$ is defined to be a geometrical object $\widetilde{M}$ such that for $\forall p\in\widetilde{M}$, there is a local chart $(U_p,\phi_p)$ enable $\phi_p:U_p\to…
We aim to construct an element satisfying Hemmer's combinatorial criterion for $H^1(\mathfrak{S}_n, S^\lambda)$ to be non-vanishing. In the process, we discover an unexpected and surprising link between the combinatorial theory of integral…
A combinatorial substitution is a map over tilings which allows to define sets of tilings with a strong hierarchical structure. In this paper, we show that such sets of tilings are sofic, that is, can be enforced by finitely many local…
We study Pythagorean hyperplane arrangements, originally defined by Zaslavsky. In this first part of a series on such arrangements, we introduce a new notion of genericity for such arrangements. Using this notion we construct an auxiliary…
We employ projective Fra\"iss\'e theory to define the "generic combinatorial $n$-simplex" as the pro-finite, simplicial complex that is canonically associated with a family of simply defined selection maps between finite triangulations of…
We present a beautiful interplay between combinatorial topology and homological algebra for a class of monoids that arise naturally in algebraic combinatorics. We explore several applications of this interplay. For instance, we provide a…
A vector composition of a vector $\mathbf{\ell}$ is a matrix $\mathbf{A}$ whose rows sum to $\mathbf{\ell}$. We define a weighted vector composition as a vector composition in which the column values of $\mathbf{A}$ may appear in different…
This paper introduces a new construction of subcomplexes associated with a truncated multicomplex. Inspired by the machinery of spectral sequences, this construction yields a collection of interrelated subcomplexes whose differentials…
In this paper, we examine the combinatorial properties of conic arrangements in the complex projective plane that possess certain quasi-homogeneous singularities. First, we introduce a new tool that enables us to characterize the property…
A generic method for combinatorial constructions of intrinsic geometrical spaces is presented. It is based on the well known inverse sequences of finite graphs that determine (in the limit) topological spaces. If a pattern of the…
The Kechris-Pestov-Todorcevic correspondence connects extreme amenability of non-Archimedean Polish groups with Ramsey properties of classes of finite structures. The purpose of the present paper is to recast it as one of the instances of a…
This is a survey of select recent results by a number of authors, inspired by the classical configuration theorems of projective geometry.
Combinatorics is a powerful tool for dealing with relations among objectives mushroomed in the past century. However, an more important work for mathematician is to apply combinatorics to other mathematics and other sciences not merely to…
We present an analogue of the differential calculus in which the role of polynomials is played by certain ordered sets and trees. Our combinatorial calculus has all nice features of the usual calculus and has an advantage that the elements…
Optics, aka functional references, are classes of tools that allow composable access into compound data structures. Usually defined as programming language libraries, they provide combinators to manipulate different shapes of data such as…
This paper exploits adjacencies between the orbits of an ordered set P and a consequence of the classification of finite simple groups to, in many cases, exponentially bound the number of automorphisms. Results clearly identify the…