Related papers: The problem of Buchstaber number and its combinato…
This paper provides a survey of results on the greatest prime factor, the number of distinct prime factors, the greatest squarefree factor and the greatest m-th powerfree part of a block of consecutive integers, both without any assumption…
The associated Buchsbaum-Rim multiplicities of a module are a descending sequence of non-negative integers. These invariants of a module are a generalization of the classical Hilbert-Samuel multiplicity of an ideal. In this article, we…
Given a polynomial map $\psi:S^m\to \mathbb{R}^k$ with components of degree $d$, we investigate the structure of the semialgebraic set $Z\subseteq S^m$ consisting of those points where $\psi$ and its derivatives satisfy a given list of…
We present a strong upper bound on the number k(B) of irreducible characters of a p-block B of a finite group G in terms of local invariants. More precisely, the bound depends on a chosen major B-subsection (u,b), its normalizer N_G(\langle…
Given a shifted order ideal $U$, we associate to it a family of simplicial complexes $(\Delta_t(U))_{t\geq 0}$ that we call squeezed complexes. In a special case, our construction gives squeezed balls that were defined and used by Kalai to…
We study the lattice of T-spaces of a free associative k-algebra over a nonempty set. It is shown that when the field k is infinite, then the lattice has a maximum element, and that maximum element is in fact a T-ideal. In striking…
We provide a new foundation for combinatorial commutative algebra and Stanley-Reisner theory using the partition complex introduced in [Adi18]. One of the main advantages is that it is entirely self-contained, using only a minimal knowledge…
The maximum $k$-colorable subgraph (M$k$CS) problem is to find an induced $k$-colorable subgraph with maximum cardinality in a given graph. This paper is an in-depth analysis of the M$k$CS problem that considers various semidefinite…
We study the combinatorial contract design problem, introduced and studied by Dutting et. al. (2021, 2022), in both the single and multi-agent settings. Prior work has examined the problem when the principal's utility function is submodular…
This paper presents a combinatorial analog of topological complexity for finite spaces. We demonstrate that this coincides with the genuine topological complexity of the original finite space, and constitutes an upper bound for the…
We propose the extension of the complex numbers to be the new domain where new concepts, like negative and imaginary probabilities, can be defined. The unit of the new space is defined as the solution of the unsolvable equation in the…
We define united K-theory for real C*-algebras, generalizing Bousfield's topological united K-theory. United K-theory incorporates three functors -- real K-theory, complex K-theory, and self-conjugate K-theory -- and the natural…
We introduce the factor complex of a neural code, and show how intervals and maximal codewords are captured by the combinatorics of factor complexes. We use these results to obtain algebraic and combinatorial characterizations of…
The classical theorem of Weitzenboeck states that the algebra of invariants of a single unipotent transformation $g$ in $GL_m(K)$ acting on the polynomial algebra $K[x_1,...,x_m]$ over a field $K$ of characteristic 0 is finitely generated.…
The moment-angle complex Z_K is cell complex with a torus action constructed from a finite simplicial complex K. When this construction is applied to a triangulated sphere K or, in particular, to the boundary of a simplicial polytope, the…
The Subspace Theorem is a powerful tool in number theory. It has appeared in various forms and been adapted and improved over time. It's applications include diophantine approximation, results about integral points on algebraic curves and…
Using the language of T-varieties, we study torus invariant curves on a complete normal variety $X$ with an effective codimension-one torus action. In the same way that the $T$-invariant Weil divisors on $X$ are sums of "vertical" divisors…
Combinatorial enumeration leads to counting generating functions presenting a wide variety of analytic types. Properties of generating functions at singularities encode valuable information regarding asymptotic counting and limit…
The purpose of this note is to give a linear algebra algorithm to find out if a rank of a given tensor over a field $\F$ is at most $k$ over the algebraic closure of $\F$, where $k$ is a given positive integer. We estimate the arithmetic…
Given a real cubic form f(x,y,z), there is a pseudo-Riemannian metric given by its Hessian matrix, defined on the open subset of R^3 where the Hessian determinant h is non-zero. We determine the full curvature tensor of this metric in terms…