Related papers: The closure-complement-frontier problem in saturat…

We derive tight expressions for the maximum number of $k$-faces, $0\le{}k\le{}d-1$, of the Minkowski sum, $P_1+...+P_r$, of $r$ convex $d$-polytopes $P_1,...,P_r$ in $\mathbb{R}^d$, where $d\ge{}2$ and $r<d$, as a (recursively defined)…

We consider the capacitated clustering problem in general metric spaces where the goal is to identify $k$ clusters and minimize the sum of the radii of the clusters (we call this the Capacitated-$k$-sumRadii problem). We are interested in…

A commuting tuple of operators $(S_1,\dots, S_{n-1},P)$, defined on a Hilbert space $\mathcal H$, for which the closed symmetrized polydisc \[ \Gamma_n =\left\{ \left(\sum_{1\leq i\leq n} z_i,\sum_{1\leq i<j\leq n}z_iz_j,\dots,…

We study productive properties of gamma spaces, and their relation to other, classic and modern, selective covering properties. Among other things, we prove the following results: 1. Solving a problem of F. Jordan, we show that for every…

In the article \cite{Sim}, H. Simmons describes two monads of interests arising from the dual adjunction between the category of topological spaces and that of (bounded) distributive lattices. These are the open prime filter monad and the…

We prove that the number of distinct homotopy types of limits of one-parameter semi-algebraic families of closed and bounded semi-algebraic sets is bounded singly exponentially in the additive complexity of any quantifier-free first order…

We prove a uniform bound on the topological Tur\'an number of an arbitrary two-dimensional simplicial complex $S$: any $n$-vertex two-dimensional complex with at least $C_S n^{3-1/5}$ facets contains a homeomorphic copy of $S$, where $C_S >…

An old conjecture of Erd\H{o}s and R\'enyi, proved by Schinzel, predicted a bound for the number of terms of a polynomial $g(x) \in \mathbb{C}[x]$ when its square $g(x)^2$ has a given number of terms. Further conjectures and results arose,…

Given an operad A of topological spaces, we consider A-monads in a topological category C . When A is an A-infinity-operad, any A-monad K : C -> C can be thought of as a monad up to coherent homotopies. We define the completion functor with…

A domination-based identification problem on a graph $G$ is one where the objective is to choose a subset $C$ of the vertex set of $G$ such that $C$ has both, a domination property, that is, $C$ is either a dominating or a total-dominating…

Consider a set of $r$ convex $d$-polytopes $P_1,P_2,...,P_r$, where $d\ge{}3$ and $r\ge{}2$, and let $n_i$ be the number of vertices of $P_i$, $1\le{}i\le{}r$. It has been shown by Fukuda and Weibel that the number of $k$-faces of the…

We apply the recently developed technology of cofinality spectrum problems to prove a range of theorems in model theory. First, we prove that any model of Peano arithmetic is $\lambda$-saturated iff it has cofinality $\geq \lambda$ and the…

New and old results on closed polynomials, i.e., such polynomials f in K[x_1,...,x_n] that the subalgebra K[f] is integrally closed in K[x_1,...,x_n], are collected. Using some properties of closed polynomials we prove the following…

2-dimensional Matching Problem, which requires to find a matching of left- to right-vertices in a balanced $2n$-vertex bipartite graph, is a well-known polynomial problem, while various variants, like the 3-dimensional analogoue (3DM, with…

Let $f_i(P)$ denote the number of $i$-dimensional faces of a convex polytope $P$. Furthermore, let $S(n,d)$ and $C(n,d)$ denote, respectively, the stacked and the cyclic $d$-dimensional polytopes on $n$ vertices. Our main result is that for…

We axiomatize the extended operators in topological orders (possibly gravitationally anomalous, possibly with degenerate ground states) in terms of monoidal Karoubi-complete $n$-categories which are mildly dualizable and have trivial…

We prove an analogue of Sadullaev's theorem concerning the size of the set where a maximal totally real manifold can meet a pluripolar set. The manifold has to be of class C-1 only. This readily leads to a version of Shcherbina's theorem…

We initiate a systematic study of the computational complexity of the Constraint Satisfaction Problem (CSP) over finite structures that may contain both relations and operations. We show the close connection between this problem and a…

If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…

For a real analytic complex vector field $L$ in an open set of $\mathbb{R}^2$, with local first integrals that are open maps, we attach a number $\mu \ge 1$ (obtained through Lojasiewicz inequalities) and show that the equation $Lu=f$ has…