Related papers: The problem of Buchstaber number and its combinato…
Three types of Cantor sets are studied.For any integer $m\ge 4$, we show that every real number in $[0,k]$ is the sum of at most $k$ $m$-th powers of elements in the Cantor ternary set $C$ for some positive integer $k$, and the smallest…
In the paper we treat Gale diagrams in a combinatorial way. The interpretation allows to describe simplicial complexes which are Alexander dual to boundaries of simplicial polytopes and, more generally, to nerve-complexes of general…
We review a class of problems on the borders of topology of torus actions, commutative homological algebra and combinatorial geometry, which is currently being investigated by Victor Buchstaber and the author. The text builds on the…
Over a regular local ring of dimension two with maximal ideal m, we study the Buchsbaum-Rim multiplicity of a finitely generated module M of finite colength in a free module F. First, we investigate the colength of an m-primary ideal and…
This paper is about a small combinatorial trick, which is well known, but has no name. Let G be a permutation group acting on a vector space M. There is a natural way to assign a cosimplicial space to these data. We call the resulting…
Point sets of number-theoretic origin, such as the visible lattice points or the $k$-th power free integers, have interesting geometric and spectral properties and give rise to topological dynamical systems that belong to a large class of…
Consider a sparse system of n Laurent polynomials in n variables with complex coefficients and support in a finite lattice set A. The maximal number of isolated roots of the system in the complex n-torus is known to be the normalized volume…
This paper gives methods for understanding invariants of symplectic quotients. The symplectic quotients considered here are compact symplectic manifolds (or more generally orbifolds), which arise as the symplectic quotients of a symplectic…
Cyclotomic polynomials are basic objects in Number Theory. Their properties depend on the number of distinct primes that intervene in the factorization of their order, and the binary case is thus the first nontrivial case. This paper sees…
An archetypal problem discussed in computer science is the problem of searching for a given number in a given set of numbers. Other than sequential search, the classic solution is to sort the list of numbers and then apply binary search.…
We prove bounds for multilinear operators on $\R^d$ given by multipliers which are singular along a $k$ dimensional subspace. The new case of interest is when the rank $k/d$ is not an integer. Connections with the concept of {\em true…
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…
Let $S$ be a finite alphabet. An injective word over $S$ is a word over $S$ such that each letter in $S$ appears at most once in the word. We study Boolean cell complexes of injective words over $S$ and their commutation classes. This…
What might a combinatorial interpretation of the Kronecker coefficients even look like? We introduce a class of combinatorial objects called bitableaux, which we believe are a natural candidate, and we formulate a purely combinatorial…
The problem of ranking can be described as follows. We have a set of combinatorial objects $S$, such as, say, the k-subsets of n things, and we can imagine that they have been arranged in some list, say lexicographically, and we want to…
We restrict geometric tangential equivariant complex $T^n$-bordism to torus manifolds and provide a complete combinatorial description of the appropriate non-commutative ring. We discover, using equivariant $K$-theory characteristic…
The class of $(d-1)$-dimensional Buchsbaum* simplicial complexes is studied. It is shown that the rank-selected subcomplexes of a (completely) balanced Buchsbaum* simplicial complex are also Buchsbaum*. Using this result, lower bounds on…
A combinatorial formula to generate U(N) character expansions is presented. It is shown that the resulting character expansion formulas greatly simplify a number of problems where integrals over the group manifolds need to be calculated.…
In a bipartite graph, a subgraph is an $s$-biplex if each vertex of the subgraph is adjacent to all but at most $s$ vertices on the opposite set. The enumeration of $s$-biplexes from a given graph is a fundamental problem in bipartite graph…
In this paper, $S$ denotes a surface homeomorphic to a punctured torus or a pair of pants. Our interest is the study of \emph{\textbf{combinatorial $k$-systoles}} that is closed curves with self-intersection numbers greater than $k$ and…