English
Related papers

Related papers: Universal entire functions that define order isomo…

200 papers

The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…

Discrete Mathematics · Computer Science 2016-06-24 Dmitry N. Kozlov

A rack of order $n$ is a binary operation $\rack$ on a set $X$ of cardinality $n$, such that right multiplication is an automorphism. More precisely, $(X,\rack)$ is a rack provided that the map $x\mapsto x\rack y$ is a bijection for all…

Geometric Topology · Mathematics 2012-03-30 Simon R. Blackburn

An elegant description of the general form of order automorphisms of effect algebras has been known in the complex case. We present a much simpler proof based on the projective geometry which works also in the real case. As an application…

Functional Analysis · Mathematics 2026-02-25 Peter Semrl

Given a sequence converging to zero, we consider the set of numbers which are sums of (infinite, finite, or empty) subsequences. When the original sequence is not absolutely summable, the subsum set is an unbounded closed interval which…

History and Overview · Mathematics 2013-07-09 Zbigniew Nitecki

In this paper, it is proved that there is, up to isomorphism, a unique generalized quadrangle of order (4,16).

Combinatorics · Mathematics 2018-10-17 Koichi Inoue

It is shown that under certain stability conditions a complemented subspace of the space $s$ of rapidly decreasing sequences is isomorphic to $s$ and this condition characterizes $s$. This result is used to show that for the classical…

Functional Analysis · Mathematics 2013-06-14 Dietmar Vogt

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…

Combinatorics · Mathematics 2021-01-19 Jan Kurkofka , Ruben Melcher

This thesis presents an alternative to Cantor's theory of cardinality, insofar as that is understood as a theory of set size. The alternative is based on a general theory, ClassSize. ClassSize contains all sentences in the first order…

Logic · Mathematics 2007-05-23 Fred M. Katz

We prove that in the Cohen extension adding $\aleph_3$ generic reals to a model of $ZFC+CH$ containing a simplified $(\omega_1,2)$-morass, gap-2 morass-definable $\eta_1$-orderings with cardinality $\aleph_3$ are order-isomorphic. Hence it…

Logic · Mathematics 2019-05-24 Bob A Dumas

In spaces of metrics, we investigate topological distributions of the doubling property, the uniform disconnectedness, and the uniform perfectness, which are the quasi-symmetrically invariant properties appearing in the David--Semmes…

Metric Geometry · Mathematics 2021-05-12 Yoshito Ishiki

The Doob convergence theorem implies that the set of divergence of any martingale has measure zero. We prove that, conversely, any $G\_{\delta\sigma}$ subset of the Cantor space with Lebesgue-measure zero can be represented as the set of…

Logic · Mathematics 2015-12-21 Dominique Lecomte , Miroslav Zeleny

The uncountability of the reals was first established by Cantor in what was later heralded as the first paper on set theory. Since the latter constitutes the official foundations of mathematics, the logical study of the uncountability of…

Logic · Mathematics 2026-04-10 Dag Normann , Sam Sanders

Discussions surrounding the nature of the infinite in mathematics have been underway for two millennia. Mathematicians, philosophers, and theologians have all taken part. The basic question has been whether the infinite exists only in…

History and Overview · Mathematics 2024-07-30 Kateřina Trlifajová

While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…

Logic in Computer Science · Computer Science 2017-04-11 Arno Pauly

A Universal Mapping Property is generally described as a characterization of an object up to a unique isomorphism by considering its relation to every other object; however, the term "by considering its relation to every other object" is…

Logic · Mathematics 2022-02-15 Talal H. Alrawajfeh

Compact sets in constructive mathematics capture our intuition of what computable subsets of the plane (or any other complete metric space) ought to be. A good representation of compact sets provides an efficient means of creating and…

Logic in Computer Science · Computer Science 2010-08-04 Russell O'Connor

The concept of Hausdorff continuous interval valued functions, developed within the theory of Hausdorff approximations and originaly defined for interval valued functions of one real variable is extended to interval valued functions defined…

Analysis of PDEs · Mathematics 2007-05-23 Roumen Anguelov

We prove that there exists a countable family of continuous real functions whose graphs together with their inverses cover an uncountable square, i.e. a set of the form $X\times X$, where $X$ is an uncountable subset of the real line. This…

Logic · Mathematics 2012-10-23 Wiesław Kubiś , Benjamin Vejnar

We prove that continuous reducibility is a well-quasi-order on the class of continuous functions between separable metrizable spaces with analytic zero-dimensional domain. To achieve this, we define scattered functions, which generalize…

Logic · Mathematics 2024-10-18 Raphaël Carroy , Yann Pequignot

This paper presents analogous results of Hua [7][8] on numbers of representations of quivers over finite fields which respect nilpotent relations under certain assumptions. A closed formula which counts isomorphism classes of absolutely…

Representation Theory · Mathematics 2021-05-06 Bangming Deng , Jiuzhao Hua