Related papers: Necessary Conditions for Geometric Realizability o…

We extend the results of B. Minemyer by showing that any indefinite metric polyhedron (either compact or not) with the vertex degree bounded from above admits an isometric simplicial embedding into a Minkowski space of the lowest possible…

A regular realizability (RR) problem is testing nonemptiness of intersection of some fixed language (filter) with given regular language. We study here complexity of RR problems. It appears that for any language L there exists RR problem…

In this survey-research paper, we first introduce the theory of Smith classes of complexes with fixed-point free, periodic maps on them. These classes, when defined for the deleted product of a simplicial complex $K$, are the same as the…

Given a collection of planar graphs $G_1,\dots,G_k$ on the same set $V$ of $n$ vertices, the simultaneous geometric embedding (with mapping) problem, or simply $k$-SGE, is to find a set $P$ of $n$ points in the plane and a bijection $\phi:…

The notion of symmetry is defined in the context of Linear and Integer Programming. Symmetric integer programs are studied from a group theoretical viewpoint. We investigate the structure of integer solutions of integer programs and show…

Given a finite simplicial complex $\mathcal{K}$ in $\mathbb{R}^n$ and a real algebraic variety $Y,$ by a $\mathcal{K}$-regular map $|\mathcal{K}|\rightarrow Y$ we mean a continuous map whose restriction to every simplex in $\mathcal{K}$ is…

For any positive integer $n$, the author previously constructed several minimal simplicial $n$-complexes which necessarily contain a non-splittable two-component link, consisting of an $(n-1)$-sphere and an $n$-sphere, in any embedding into…

We consider $K$-semialgebras for a commutative semiring $K$ that are at the same time $\Sigma$-algebras and satisfy certain linearity conditions. When each finite system of guarded polynomial fixed point equations has a unique solution over…

We relate the embeddability of the simplicial complex $[3]*K$ into $\mathbb{R}^{n+2}$ to that of $K$ into $\mathbb{R}^n$. In brief, the embeddability of $K$ into $\mathbb{R}^n$, in the metastable range $2n\geq 3(d+1)$, is equivalent to the…

Let n and k be positive integers with and k < n. Then of course SU(k,1) is contained into SU(n,1). Moreover, which is less clear - but proved by Khoroshkin -, the representation theory of SU(k,1) at the generalized infinitesimal character…

We consider the problem of solving a linear system of equations which involves complex variables and their conjugates. We characterize when it reduces to a complex linear system, that is, a system involving only complex variables (and not…

We demonstrate the existence of minimal simplicial $n$-complexes which inevitably contain a nonsplittable two-component link formed by an $(n-1)$-sphere and an $n$-sphere in any embedding into $\mathbb{R}^{2n}$. This provides a…

Quadratic systems generated using Yang-Baxter equations are integrable in a sense, but we display a deterioration in the possession of the Painlev\'e property as the number of equations in each `integrable system' increases. Certain…

In this paper, we provide a simple proof for the fact that two simplicial complexes are isomorphic if and only if their associated Stanley-Reisner rings, or their associated facet rings are isomorphic as $K$-algebras. As a consequence, we…

We introduce combinatorial types of arrangements of convex bodies, extending order types of point sets to arrangements of convex bodies, and study their realization spaces. Our main results witness a trade-off between the combinatorial…

We show that the following algorithmic problem is decidable: given a $2$-dimensional simplicial complex, can it be embedded (topologically, or equivalently, piecewise linearly) in $\mathbf{R}^3$? By a known reduction, it suffices to decide…

For a given pair of numbers $(d,k)$, we establish the minimal number of vertices in pure $d$-dimensional simplicial complexes with non-trivial homology in dimension $k$. Furthermore, we solve the problem under the additional constraint of…

Let $G$ be a finite abelian group with exponent $n$, and let $r$ be a positive integer. Let $A$ be a $k\times m$ matrix with integer entries. We show that if $A$ satisfies some natural conditions and $|G|$ is large enough then, for each…

It is well-known that if a subset A of a finite Abelian group G satisfies a quasirandomness property called uniformity of degree k, then it contains roughly the expected number of arithmetic progressions of length k, that is, the number of…

Motivated by satisfiability of constraints with function symbols, we consider numerical inequalities on non-negative integers. The constraints we consider are a conjunction of a linear system Ax = b and a conjunction of (non-)convex…