Related papers: Polynomial interpolation in higher dimension: from…
We prove a formula for double Schubert and Grothendieck polynomials specialized to two rearrangements of the same set of variables. Our formula generalizes the usual formulas for Schubert and Grothendieck polynomials in terms of RC-graphs,…
In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…
Recently $C^m$-conforming finite elements on simplexes in arbitrary dimension are constructed by Hu, Lin and Wu. The key in the construction is a non-overlapping decomposition of the simplicial lattice in which each component will be used…
Gcd-graphs represent an interesting and historically important class of integral graphs. Since the pioneering work of Klotz and Sander, numerous incarnations of these graphs have been explored in the literature. In this article, we define…
The aim of this paper is a characterization of great antipodal sets of complex Grassmannian manifolds as certain designs with the smallest cardinalities.
We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…
A new projection operator based on cylindrical algebraic decomposition (CAD) is proposed. The new operator computes the intersection of projection factor sets produced by different CAD projection orders. In other words, it computes the gcd…
This article introduces Gamma-triangles, which are closely related to and more fundamental than F-triangles and H-triangles that have been used in the combinatorics of cluster complexes. It is proved that Gamma-triangles can be expressed as…
A basic combinatorial invariant of a convex polytope $P$ is its $f$-vector $f(P)=(f_0,f_1,\dots,f_{\dim P-1})$, where $f_i$ is the number of $i$-dimensional faces of $P$. Steinitz characterized all possible $f$-vectors of $3$-polytopes and…
The cluster-tilted algebras have been introduced by Buan, Marsh and Reiten, they are the endomorphism rings of cluster-tilting objects $T$ in cluster categories; we call such an algebra cluster-concealed in case $T$ is obtained from a…
We develop the theory of CW(A)-complexes, which generalizes the classical theory of CW-complexes, keeping the geometric intuition of J.H.C. Whitehead's original theory. We obtain this way generalizations of classical results, such as…
Let K be a simplicial complex with vertex set V = {v_1,..., v_n}. The complex K is d-representable if there is a collection {C_1,...,C_n} of convex sets in R^d such that a subcollection {C_{i_1},...,C_{i_j}} has a nonempty intersection if…
We generalise the existence of combinatorial designs to the setting of subset sums in lattices with coordinates indexed by labelled faces of simplicial complexes. This general framework includes the problem of decomposing hypergraphs with…
The paper studies the complex 1-dimensional polynomial vector fields with real coefficients under topological orbital equivalence preserving the separatrices of the pole at infinity. The number of generic strata is determined, and a…
The purpose of this paper is to generalize the self-duality equation by Tchrakian and Corrigan et. al.. Novel generalized self-duality equations on higher-dimensional spaces are discussed. This class of equations includes the usual…
With every family of finitely many subsets of a finite-dimensional vector space over the Galois-field with two elements we associate a cyclic transversal polytope. It turns out that those polytopes generalize several well-known polytopes…
Dimension theory lies at the heart of fractal geometry and concerns the rigorous quantification of how large a subset of a metric space is. There are many notions of dimension to consider, and part of the richness of the subject is in…
We consider a class of generalized binomials emerging in fractional calculus. After establishing some general properties, we focus on a particular yet relevant case, for which we provide several ready-for-use combinatorial identities,…
Triangular decomposition is one of the standard ways to represent the radical of a polynomial ideal. A general algorithm for computing such a decomposition was proposed by A. Szanto. In this paper, we give the first complete bounds for the…
In this article, we give two different sufficient conditions for the irreducibility of a polynomial of more than one variable, over the field of complex numbers, that can be written as a sum of two polynomials which depend on mutually…