Related papers: Semi-linear stars are contractible
We introduce an operator on classes of regular languages, the star-free closure. Our motivation is to generalize standard results of automata theory within a unified framework. Given an arbitrary input class $C$, the star-free closure…
A complex projective manifold is rationally connected, resp. rationally simply connected, if finite subsets are connected by a rational curve, resp. the spaces parameterizing these connecting rational curves are themselves rationally…
A partial semigroup is a set with restricted binary operation. In this work we will extend a result due to V. Bergelson and N. Hindman concerning the rich structure presented in the product space of semigroups to partial semigroup. An…
Using a recent description of the geometric stability manifold, we show the geometric stability manifold associated to any smooth projective complex surface is contractible. We then use this result to demonstrate infinitely many new…
Given a partial (resp. a global) action $\alpha$ of a connected finite groupoid $G$ on a ring $A$, we determine necessary and sufficient conditions for the partial (resp. global) skew groupoid ring $A\star_{\alpha} G$ to be a separable…
We prove that a contractible orbifold is a manifold.
We introduce the notion of ST-pairs of triangulated subcategories, a prototypical example of which is the pair of the bound homotopy category and the bound derived category of a finite-dimensional algebra. For an ST-pair $(\C,\D)$, we…
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$.…
We show that many important varieties and sets of varieties of semigroups may be defined by relatively simple and transparent first-order formulas in the lattice of all semigroup varieties.
When a linear order has an order preserving surjection onto each of its suborders we say that it is strongly surjective. We prove that the set of countable strongly surjective linear orders is complete for the class of sets which are the…
In this short note we prove that in many cases the failure of a variety to be separably rationally connected is caused by the instability of the tangent sheaf (if there are no other obvious reasons). A simple application of the results…
Let X be a normed linear space. We examine if every open, convex and unbounded subset of X is equal to the union of a family of open straight half lines. The answer is affirmative if and only if X is finite dimensional.
We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…
Let $\mathcal{W}^{n}$ be the class of $C^{\infty }$ complete simply connected $n-$dimensional manifolds without conjugate points. The hyperbolic space as well as Euclidean space are good examples of such manifolds. Let $% W\in…
Close binary stars are binary stars where the component stars are close enough such that they can exchange mass and/or energy. They are subdivided into semi-detached, overcontact or ellipsoidal binary stars. A challenging problem in the…
This paper presents the first in a series of results that allow us to develop a theory providing finer control over the complexity of normalisation, and in particular of cut elimination. By considering atoms as self-dual non-commutative…
The directions of an infinite graph $G$ are a tangle-like description of its ends: they are choice functions that choose compatibly for all finite vertex sets $X\subseteq V(G)$ a component of $G-X$. Although every direction is induced by a…
We state conditions for which a definable local homomorphism between two locally definable groups $\mathcal{G}$, $\mathcal{G^{\prime}}$ can be uniquely extended when $\mathcal{G}$ is simply connected (Theorem 2.1). As an application of this…
A semantic model enjoys full definability if every semantic element in the model is a denotation of some proof or program. Full definability indicates that the model captures programs and proofs in a highly detailed manner. This paper…
A classical question in PL topology, asked among others by Hudson, Lickorish, and Kirby, is whether every linear subdivision of the d-simplex is simplicially collapsible. The answer is known to be positive for d<4. We solve the problem up…