Related papers: On the recognition problem for virtually special c…

We consider a finitely generated virtually abelian group $G$ acting properly and without inversions on a CAT(0) cube complex $X$. We prove that $G$ stabilizes a finite dimensional CAT(0) subcomplex $Y \subseteq X$ that is isometrically…

Ensembles of composite quantum states can exhibit nonlocal behaviour in the sense that their optimal discrimination may require global operations. Such an ensemble containing N pairwise orthogonal pure states, however, can always be…

Rounding has proven to be a fundamental tool in theoretical computer science. By observing that rounding and partitioning of $\mathbb{R}^d$ are equivalent, we introduce the following natural partition problem which we call the {\em secluded…

A result of Beauville states that with a few positive characterstic exceptions, the smooth hyperplane sections of hypersurfaces of degree $d>2$ in projective space are not all isomorphic. We address the question of whether these sections…

We show that for any two convex curves $C_1$ and $C_2$ in $\mathbb R^d$ parametrized by $[0,1]$ with opposite orientations, there exists a hyperplane $H$ with the following property: For any $t\in [0,1]$ the points $C_1(t)$ and $C_2(t)$ are…

Let W be the germ of a smooth complex surface around an exceptional curve and let E be a rank 2 vector bundle on W. We study the cohomological properties of a finite sequence $E_i, 1 \leq i \leq t$ of rank 2 vector bundles canonically…

Let M be a complete hyperbolic 3-manifold of finite volume that admits a decomposition into right-angled ideal polyhedra. We show that M has a deformation retraction that is a virtually special square complex, in the sense of Haglund and…

We continue to study and present concrete examples in characteristic 2 of compound Du Val singularities defined over an algebraically closed field which have one dimensional singular loci but cannot be written as products (a rational double…

We give two provably accurate feature-selection techniques for the linear SVM. The algorithms run in deterministic and randomized time respectively. Our algorithms can be used in an unsupervised or supervised setting. The supervised…

We show that if f: X --> Y is a finite, separable morphism of smooth curves defined over a finite field F_q, where q is larger than an explicit constant depending only on the degree of f and the genus of X, then f maps X(F_q) surjectively…

We find sharp upper bounds on the order of the automorphism group of a hypersurface in complex projective space in every dimension and degree. In each case, we prove that the hypersurface realizing the upper bound is unique up to…

A finitely generated subgroup H of a torsion-free hyperbolic group G is called immutable if there are only finitely many conjugacy classes of injections of H into G. We show that there is no uniform algorithm to recognize immutability,…

In this paper, we investigate the hitting set problem and demonstrate that solution independence is the crucial property underlying the construction of self-referential instances. As a special case of the hitting set problem, the vertex…

We study the transference through finite index extensions of the notion of equational coherence, as well as its effective counterpart. We deduce an explicit algorithm for solving the following algorithmic problem about size two integral…

The present phase of Machine Learning is characterized by supervised learning algorithms relying on large sets of labeled examples ($n \to \infty$). The next phase is likely to focus on algorithms capable of learning from very few labeled…

We show that the normal points of a cubic hypersurface in projective space have canonical singularities unless the hypersurface is an iterated cone over an elliptic curve. As an application, we give a simple linear algebraic description of…

In this article we give an explicit algorithm which will determine, in a discrete and computable way, whether a finite piecewise Euclidean complex is non-positively curved. In particular, given such a complex we show how to define a boolean…

In the area of symbolic-numerical computation within computer algebra, an interesting question is how "close" a random input is to the "critical" ones, like the singular matrices in linear algebra or the polynomials with multiple roots for…

We establish a fundamental impossibility result for a `perfect hypervisor', one that (1) preserves every observable behavior of any program exactly as on bare metal and (2) adds zero timing or resource overhead. Within this model we prove…

With the help of hyper-ideal circle pattern theory, we have developed a discrete version of the classical uniformization theorems for surfaces represented as finite branched covers over the Riemann sphere as well as compact polyhedral…