Related papers: Collapsibility to a subcomplex of a given dimensio…

Let $\mathcal{C}(n,k)$ be the set of $k$-dimensional simplicial complexes $C$ over a fixed set of $n$ vertices such that: (1) $C$ has a complete $k-1$-skeleton; (2) $C$ has precisely ${{n-1}\choose {k}}$ $k$-faces; (3) the homology group…

In the last 20 years a whole hierarchy of notions of tractability was proposed and analyzed by several authors. These notions are used to classify the computational hardness of continuous numerical problems $S=(S_d)_{d\in\mathbb{N}}$ in…

In this paper we study some sophisticated supercongruences involving dual sequences. For $n=0,1,2,\ldots$ define $$d_n(x)=\sum_{k=0}^n\binom nk\binom xk2^k$$ and $$s_n(x)=\sum_{k=0}^n\binom nk\binom xk\binom{x+k}k=\sum_{k=0}^n\binom…

The problem of calculating exact lower bounds for the number of $k$-faces of $d$-polytopes with $n$ vertices, for each value of $k$, and characterising the minimisers, has recently been solved for $n\le2d$. We establish the corresponding…

It is well known that solving a (non-convex) quadratic program is NP-hard. We show that the problem remains hard even if we are only looking for a Karush-Kuhn-Tucker (KKT) point, instead of a global optimum. Namely, we prove that computing…

Given a simplicial complex $K$, we consider several notions of geometric complexity of embeddings of $K$ in a Euclidean space ${\mathbb R}^d$: thickness, distortion, and refinement complexity (the minimal number of simplices needed for a PL…

A $1$-factorization of the complete multigraph $\lambda K_{2n}$ is said to be indecomposable if it cannot be represented as the union of $1$-factorizations of $\lambda_0 K_{2n}$ and $(\lambda-\lambda_0) K_{2n}$, where $\lambda_0<\lambda$.…

We investigate the question of whether any $d$-colorable simplicial $d$-polytope can be octahedralized, i.e., it can be subdivided to a $d$-dimensional geometric cross-polytopal complex. We give a positive answer in dimension $3$, with the…

In graph realization problems one is given a degree sequence and the task is to decide whether there is a graph whose vertex degrees match to the given sequence. This realization problem is known to be polynomial-time solvable when the…

It was proved in 1998 by Ben-David and Litman that a concept space has a sample compression scheme of size d if and only if every finite subspace has a sample compression scheme of size d. In the compactness theorem, measurability of the…

The dimension of a linear space is the maximum positive integer $d$ such that any $d$ of its points generate a proper subspace. For a set $K$ of integers at least two, recall that a pairwise balanced design PBD$(v,K)$ is a linear space on…

We introduce and study certain notions which might serve as substitutes for maximum density packings and minimum density coverings. A body is a compact connected set which is the closure of its interior. A packing $\cal P$ with congruent…

In this paper we prove that if S is a smooth, irreducible, projective, rational, complex surface and D an effective, connected, reduced divisor on S, then the pair (S,D) is contractible if the log-Kodaira dimension of the pair is $-\infty$.…

Interpreting three-leaf binary trees or {\em rooted triples} as constraints yields an entailment relation, whereby binary trees satisfying some rooted triples must also thus satisfy others, and thence a closure operator, which is known to…

We study Constraint Satisfaction Problems (CSPs) in an infinite context. We show that the dichotomy between easy and hard problems -- established already in the finite case -- presents itself as the strength of the corresponding De…

We study families of axis-aligned boxes in a $d$-dimensional Euclidean space $\mathbb{R}^d$ whose placement is restricted by bounds on the dimension of their pairwise intersections. More specifically, two such boxes in $\mathbb{R}^d$ are…

An N=4 supersymmetric extension of the l-conformal Galilei algebra is constructed. This is achieved by combining generators of spatial symmetries from the l-conformal Galilei algebra and those underlying the most general superconformal…

We show that the maximal extension sl(2) times psl(2|2) times C3 of the sl(2|2) superalgebra can be obtained as a contraction limit of the semi-simple superalgebra d(2,1;epsilon) times sl(2). We reproduce earlier results on the…

In this paper, we show that a general polarized abelian variety $(X,L)$ of type $(1,\dots,1,d)$ and dimension $g$ satisfies property $(N_p)$ if $ d \geq \sum_{i=0}^{g} (p+2)^i$. In particular, the case $p=0$ affirmatively solves a…

We demonstrate that two-dimensional N=8 supersymmetric quantum mechanics which inherits the most interesting properties of $N=2, d=4$ SYM can be constructed if the reduction to one dimension is performed in terms of the basic object, i.e.…