English
Related papers

Related papers: Cantor-Schr\"oder-Bernstein theorem for a class of…

200 papers

A famous theorem of Bers and Finn states that isolated singularities of solutions to the non-parametric minimal surface equation are removable. We show that this result remains valid, if the area functional is replaced by a general…

Analysis of PDEs · Mathematics 2022-06-02 Michael Bildhauer , Martin Fuchs

We show that a family of random variables is uniformly integrable if and only if it is stochastically bounded in the increasing convex order by an integrable random variable. This result is complemented by proving analogous statements for…

Probability · Mathematics 2011-06-06 Lasse Leskelä , Matti Vihola

The group of $\mathcal C^1$-diffeomorphisms of any sparse Cantor subset of a manifold is countable and discrete (possibly trivial). Thompson's groups come out of this construction when we consider central ternary Cantor subsets of an…

Geometric Topology · Mathematics 2019-01-25 Louis Funar , Yurii Neretin

We prove a Berger-type theorem which asserts that if the orthogonal subgroup generated by the torsion tensor (pulled back to a point by parallel transport) of a metric connection with skew-symmetric torsion is not transitive on the sphere,…

Differential Geometry · Mathematics 2017-10-16 Silvio Reggiani

Let X be a (connected and reduced) complex space. A q-collar of X is a bounded domain whose boundary is a union of a strongly q-pseudoconvex, a strongly q-pseudoncave and two flat (i.e. locally zero sets of pluriharmonic functions)…

Complex Variables · Mathematics 2008-02-04 Alberto Saracco , Giuseppe Tomassini

We establish a necessary condition that an automorphism of a nontrivial finitely generated bi-orderable group can preserve a bi-ordering: at least one of its eigenvalues, suitably defined, must be real and positive. Applications are given…

Algebraic Topology · Mathematics 2010-05-28 Adam Clay , Dale Rolfsen

We study topologization of the semigroup $\mathscr{O\!\!I}\!_n(L)$ of finite partial order isomorphisms of a bounded rank of an infinite linear ordered set $(L,\leqslant)$. In particular we show that every $T_1$ left-topological…

Group Theory · Mathematics 2025-12-01 Oleg Gutik , Maksym Shchypel

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Logic · Mathematics 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

A binary shuffle square is a binary word of even length that can be partitioned into two disjoint, identical subwords. Huang, Nam, Thaper, and the first author conjectured that as $n\rightarrow \infty$, asymptotically half of all binary…

Combinatorics · Mathematics 2025-12-16 Xiaoyu He , Logan Post

For G a finite non-Abelian group we write c(G) for the probability that two randomly chosen elements commute and k(G) for the largest integer such that any k(G)-colouring of G is guaranteed to contain a monochromatic quadruple (x,y,xy,yx)…

Combinatorics · Mathematics 2019-11-11 Tom Sanders

Let $\mathcal{D}=(d_n)_{n=1}^\infty$ be a bounded sequence of integers with $d_n\ge 2$ and let $(i, j)$ be a pair of strictly positive numbers with $i+j=1$. We prove that the set of $x \in \RR$ for which there exists some constant $c(x) >…

Number Theory · Mathematics 2014-01-14 Dzmitry Badziahin , Jason Levesley , Sanju Velani

For a linearly ordered group $G$ let us define a subset $A\subseteq G$ to be a \emph{shift-set} if for any $x,y,z\in A$ with $y < x$ we get $x\cdot y^{-1}\cdot z\in A$. We describe the natural partial order and solutions of equations on the…

Group Theory · Mathematics 2017-12-27 Oleg Gutik , Kateryna Maksymyk

There are well known algorithms to compute the class group of the maximal order $\mathcal{O}_K$ of a number field $K$ and the group of invertible ideal classes of a non-maximal order $R$. In this paper we explain how to compute also the…

Number Theory · Mathematics 2020-08-18 Stefano Marseglia

For partially ordered sets $X$ we consider the square matrices $M^{X}$ with rows and columns indexed by linear extensions of the partial order on $X$. Each entry $\left( M^{X}\right)_{PQ}$ is a formal variable defined by a pedestal of the…

Combinatorics · Mathematics 2024-03-15 Richard Kenyon , Maxim Kontsevich , Oleg Ogievetsky , Cosmin Pohoata , Will Sawin , Senya Shlosman

We study the computational and structural aspects of countable two-dimensional SFTs and other subshifts. Our main focus is on the topological derivatives and subpattern posets of these objects, and our main results are constructions of…

Computational Complexity · Computer Science 2012-08-15 Ville Salo , Ilkka Törmä

It is shown that the coloured isomorphism class of a unital, simple, $\mathcal{Z}$-stable, separable amenable C$^*$-algebra satisfying the Universal Coefficient Theorem (UCT) is determined by its tracial simplex.

Operator Algebras · Mathematics 2022-04-14 Jeffrey Im , George A. Elliott

A remarkable theorem due to Peter Dembowski states that if $I$ is an inversive plane of even order $q$ then $q$ must be a power of two and $I$ must be the incidence system of points versus plane ovals in an ovoid in the projective $3$-space…

Combinatorics · Mathematics 2023-03-06 Bhaskar Bagchi

A basic problem in the theory of partially ordered vector spaces is to characterise those cones on which every order-isomorphism is linear. We show that this is the case for every Archimedean cone that equals the inf-sup hull of the sum of…

Functional Analysis · Mathematics 2023-11-27 Bas Lemmens , Hent van Imhoff , Onno van Gaans

A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that…

Formal Languages and Automata Theory · Computer Science 2019-04-25 Kitti Gelle , Szabolcs Ivan

Let $X$ be a Banach space. We study the circumstances under which there exists an uncountable set $\mathcal A\subset X$ of unit vectors such that $\|x-y\|>1$ for distinct $x,y\in \mathcal A$. We prove that such a set exists if $X$ is…

Functional Analysis · Mathematics 2016-10-26 Tomasz Kania , Tomasz Kochanek