Related papers: The problem of Buchstaber number and its combinato…
One of our result is that 5 measurable sets in $R^8$ always admit an equipartition by 2 hyperplanes. This is an instance of a general equipartition problem (formulated by B. Gr{\" u}nbaum and H. Hadwiger) which can be reduced to the…
Random shapes arise naturally in many contexts. The topological and geometric structure of such objects is interesting for its own sake, and also for applications. In physics, for example, such objects arise naturally in quantum gravity, in…
We describe an explicit chain map from the standard resolution to the minimal resolution for the finite cyclic group Z_k of order k. We then demonstrate how such a chain map induces a "Z_k-combinatorial Stokes theorem", which in turn…
Multiplicative invariance is a well-studied property of subsets of the unit interval. The theory in the complex plane is less developed. This paper introduces an analogous definition for multiplicative invariance in the complex plane…
Substitute valuations (in some contexts called gross substitute valuations) are prominent in combinatorial auction theory. An algorithm is given in this paper for generating a substitute valuation through Monte Carlo simulation. In…
In this paper we develop combinatorial techniques for the case of string algebras with the aim to give a characterization of string complexes with infinite minimal projective resolution. These complexes will be called \textit{periodic…
We consider the monodromy matrix for the pure spinor IIB superstring on $AdS_5\times S^5$ at leading order at strong coupling, in particular its variation under an infinitesimal and continuous deformation of the contour. Such variation is…
The main purpose of this article is to extend some of the ideas from Schubert calculus to the more general setting of Hamiltonian torus actions on compact symplectic manifolds with isolated fixed points. Given a generic component of the…
We present a new formulation of the maximum clique problem of a graph in complex space. We start observing that the adjacency matrix A of a graph can always be written in the form A = B B where B is a complex, symmetric matrix formed by…
A wide variety of problems in combinatorics and discrete optimization depend on counting the set $S$ of integer points in a polytope, or in some more general object constructed via discrete geometry and first-order logic. We take a tour…
We consider the structure of Pisot substitution tiling spaces, in particular, the structure of those spaces for which the translation action does not have pure discrete spectrum. Such a space is always a measurable m-to-one cover of an…
The Hirzebruch $td_y(X)$ class of a complex manifold X is a formal combination of Chern characters of the sheaves of differential forms multiplied by the Todd class. The related $\chi_y$-genus admits a generalization for singular complex…
A simplicial complex $H$ consists of a pair of sets $(V,E)$ where $V$ is a set of vertices and $E\subseteq\mathscr{P}(V)$ is a collection of subsets of $V$ closed under taking subsets. Given a simplicial complex $F$ and $n\in \mathbb N$,…
We calculate the WKB series for the angular momentum and the non--relativistic 3-dim Kepler problem. This is the first semiclassical treatment of the angular momentum for terms beyond the leading WKB approximation. We explain why the torus…
We introduce and study a family of simplicial complexes associated to an arbitrary finite root system and a nonnegative integer parameter m. For m=1, our construction specializes to the (simplicial) generalized associahedra or,…
The involutory birack counting invariant is an integer-valued invariant of unoriented tangles defined by counting homomorphisms from the fundamental involutory birack of the tangle to a finite involutory birack over a set of framings modulo…
We give an explicit combinatorial description of the irreducible components of the singular locus of the Schubert variety X_w for any element w in S_n. Our description of the irreducible components is computationally more efficient (O(n^6))…
Given a square matrix B=(b_{ij}) with real entries, the optimal assignment problem is to find a bijection s between the rows and the columns maximising the sum of the b_{is(i)}. In discrete optimal control and in the theory of discrete…
In view of Tucker's lemma (an equivalent combinatorial version of the Borsuk- Ulam theorem), the present authors (2013) introduced the kth altermatic number of a graph G as a tight lower bound for the chromatic number of G. In this note, we…
We prove that the semi-invariant ring of the standard representation space of the $l$-flagged $m$-arrow Kronecker quiver is an upper cluster algebra for any $l,m\in \mathbb{N}$. The quiver and cluster are explicitly given. We prove that the…