Related papers: Extendability of simplicial maps is undecidable

We formulate a novel characterization of a family of invertible maps between two-dimensional domains. Our work follows two classic results: The Rad\'o-Kneser-Choquet (RKC) theorem, which establishes the invertibility of harmonic maps into a…

We present the notion of facet-complexity, $\text{C}(\mathsf{L};\mathsf{K})$, for two simplicial complexes $\mathsf{L}$ and $\mathsf{K}$, along with basic results for this numerical invariant. This invariant…

We classify the Lie algebras of infinitesimal CR automorphisms of weakly pseudoconvex hypersurfaces of finite multitype in $\mathbb C^N$. In particular, we prove that such manifolds admit neither nonlinear rigid automorphisms, nor real or…

In this paper, we show that an irreducible proper complex equifocal submanifold of codimension greater than one in a symmetric space of non-compact type. The proof is performed by showing the homogeneity of the lift of the complexification…

Let $A$ be a separable amenable $C^*$-algebra and $B$ a non-unital and $\sigma$-unital simple $C^*$-algebra with continuous scale ($B$ need not be stable). We classify, up to unitary equivalence, all essential extensions of the form $0…

The main result of D. Archdeacon, M. Conder and J. \v{S}ir\'a\v{n} [Trans. Amer. Math. Soc. 366 (2014) 8, 4491-4512] implies existence of a regular, self-dual and self-Petrie dual map of any given even valency. In this paper we extend this…

Let k be an algebraically closed field and A a finite dimensional associative k-algebra. We prove that there is no gap in the lengths of indecomposable A-modules of finite length. The analogous result holds for an abelian k-linear category…

Weakly well-designed SPARQL patterns is a recent generalisation of well-designed patterns, which preserve good computational properties but also capture almost all patterns that appear in practice. Subsumption is one of static analysis…

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…

We study the problem of \emph{robust satisfiability} of systems of nonlinear equations, namely, whether for a given continuous function $f:\,K\to\mathbb{R}^n$ on a~finite simplicial complex $K$ and $\alpha>0$, it holds that each function…

We prove that the Cayley-Menger determinant of an $n$-dimensional simplex is an absolutely irreducible polynomial for $n\geq3.$ We also study the irreducibility of polynomials associated to related geometric constructions.

We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment,…

We prove a graded version of Alev-Polo's rigidity theorem: the homogenization of the universal enveloping algebra of a semisimple Lie algebra and the Rees ring of the Weyl algebras $A_n(k)$ cannot be isomorphic to their fixed subring under…

For each positive integer k, we describe a map f from the complex plane to a suitable non-complete complex locally convex space such that f is k times continuously complex differentiable but not k+1 times, and hence not complex analytic. We…

The structure of the set of positivity-preserving maps between matrix algebras is notoriously difficult to describe. The notable exceptions are the results by St{\o}rmer and Woronowicz from 1960s and 1970s settling the low dimensional…

We consider semidifferentiable (possibly nonsmooth) maps, acting on a subset of a Banach space, that are nonexpansive either in the norm of the space or in the Hilbert's or Thompson's metric inherited from a convex cone. We show that the…

We investigate the impact of non-regular path expressions on the decidability of satisfiability checking and querying in description logics extending ALC. Our primary objects of interest are ALCreg and ALCvpl, the extensions of with path…

Goedel Incompleteness Theorem leaves open a way around it, vaguely perceived for a long time but not clearly identified. (Thus, Goedel believed informal arguments can answer any math question.) Closing this loophole does not seem obvious…

Recently it has been proved that, assuming that there is an almost disjoint family of cardinality (2^{\mathfrak c}) in (\mathfrak c) (which is assured, for instance, by either Martin's Axiom, or CH, or even $2^{<\mathfrak c=\mathfrak c$})…

Many results in extremal graph theory can be formulated as certain polynomial inequalities in graph homomorphism densities. Answering fundamental questions raised by Lov{\'a}sz, Szegedy and Razborov, Hatami and Norine proved that…