Related papers: The problem of Buchstaber number and its combinato…
We study sums of the form $\sum_{k=m}^n a_{nk} b_{km}$, where $a_{nk}$ and $b_{km}$ are binomial coefficients or unsigned Stirling numbers. In a few cases they can be written in closed form. Failing that, the sums still share many common…
The socle of a graded Buchsbaum module is studied and is related to its local cohomology modules. This algebraic result is then applied to face enumeration of Buchsbaum simplicial complexes and posets. In particular, new necessary…
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happens for instance when the constraint matrix is totally…
We consider an operation K \to L(K) on the set of simplicial complexes, which we call the "doubling operation". This combinatorial operation has been recently brought into toric topology by the work of Bahri, Bendersky, Cohen and Gitler on…
We introduce a combinatorial characterization of simpliciality for arrangements of hyperplanes. We then give a sharp upper bound for the number of hyperplanes of such an arrangement in the projective plane over a finite field, and present…
A flexible unified framework for both classical and quantum Schubert calculus is proposed. It is based on a natural combinatorial approach relying on the Hasse-Schmidt extension of a certain family of pairwise commuting endomorphisms of an…
S. Ekhad and D. Zeilberger recently proved that the multivariate generating function for the number of simple singular vector tuples of a generic $m_1 \times \cdots \times m_d$ tensor has an elegant rational form involving elementary…
The aim of this article is to study (additively) indecomposable algebraic integers $\mathcal O_K$ of biquadratic number fields $K$ and universal totally positive quadratic forms with coefficients in $\mathcal O_K$. There are given…
Let G be a finite group acting on a finite dimensional real vector space V. We denote by P(V) the projective space associated to V. In this paper we compute in a very explicit way the rank of the equivariant complex K-theory of V and P(V),…
This study develops an algorithm to solve a variation of the Shortest Common Superstring (SCS) problem. There are two modifications to the base SCS problem. First, one string in the set S is allowed to have up to K mistakes, defined as not…
For certain problems involving vector fields, it is possible to find an associated imaginary field that, in conjunction with the first, forms a complex field for which the equation can be solved. This result is generalized to arbitrary…
We investigate combinatorial aspects of exceptional sequences in the derived category of coherent sheaves on certain smooth and complete algebraic surfaces. We show that to any such sequence there is canonically associated a complete toric…
The paper deals with combinatorial and stochastic structures of cubical token systems. A cubical token system is an instance of a token system, which in turn is an instance of a transition system. It is shown that some basic results of…
Let us consider an infinite word and $k\geq 1$ an integer. By steps of $k$, we substitute a letter ofthis infinite word by the power of an external letter. The new word obtaining by this process is called $k$ to $k$ substitution of a power…
Let $R=\Bbbk[x_1,\dots,x_n]$ be a polynomial ring over a field $\Bbbk$ and let $I\subset R$ be a monomial ideal preserved by the natural action of the symmetric group $\mathfrak S_n$ on $R$. We give a combinatorial method to determine the…
We consider a finite permutation group acting naturally on a vector space $V$ over a field $\Bbbk$. A well known theorem of G\"obel asserts that the corresponding ring of invariants $\Bbbk[V]^G$ is generated by invariants of degree at most…
A paper of the first author and Zilke proposed seven combinatorial problems around formulas for the characteristic polynomial and the exponents of an isolated quasihomogeneous singularity. The most important of them was a conjecture on the…
Given a countable set X (usually taken to be N or Z), an infinite permutation $\pi$ of X is a linear ordering $<_\pi$ of X. This paper investigates the combinatorial complexity of infinite permutations on N associated with the image of…
Given a finite nonempty sequence S of integers, write it as XY^k, where Y^k is a power of greatest exponent that is a suffix of S: this k is the curling number of S. The Curling Number Conjecture is that if one starts with any initial…
We generalize the Stirling numbers of the first kind $s(a,k)$ to the case where $a$ may be an arbitrary real number. In particular, we study the case in which $a$ is an integer. There, we discover new combinatorial properties held by the…