English
Related papers

Related papers: On countability and representations

200 papers

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

Logic · Mathematics 2016-02-02 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

Representation theorems relate seemingly complex objects to concrete, more tractable ones. In this paper, we take advantage of the abstraction power of category theory and provide a general representation theorem for a wide class of…

Programming Languages · Computer Science 2015-02-05 Mauro Jaskelioff , Russell O'Connor

We show that the embeddability relations for countable quandles and for countable fields of any given characteristic other than 2 are maximally complex in a strong sense: they are invariantly universal. This notion from the theory of Borel…

Logic · Mathematics 2020-07-21 Andrew D. Brooke-Taylor , Filippo Calderoni , Sheila K. Miller

We study the problem of learning permutation invariant representations that can capture "flexible" notions of containment. We formalize this problem via a measure theoretic definition of multisets, and obtain a theoretically-motivated…

Machine Learning · Computer Science 2019-11-21 Vasco Portilheiro

We propose that observables in quantum theory are properly understood as representatives of symmetry-invariant quantities relating one system to another, the latter to be called a reference system. We provide a rigorous mathematical…

Quantum Physics · Physics 2018-03-14 Leon Loveridge , Takayuki Miyadera , Paul Busch

With this paper we hope to contribute to the theory of quantales and quantale-like structures. It considers the notion of $Q$-sup-algebra and shows a representation theorem for such structures generalizing the well-known representation…

Logic · Mathematics 2018-10-24 Jan Paseka , Radek Šlesinger

We investigate computability in the lattice of equivalence relations on the natural numbers. We mostly investigate whether the subsets of appropriately defined subrecursive equivalence relations -for example the set of all polynomial-time…

Computational Complexity · Computer Science 2017-04-20 Jean-Yves Moyen , Jakob Grue Simonsen

This paper provides some counterexamples to Cantor's contributions to the foundations of Set Theory. The first counterexample forces Cantor's Diagonal Method (DM) to yield one of the numbers in the target list. To study this anomaly, and…

General Mathematics · Mathematics 2014-04-28 Enrique Coiras

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

Rings and Algebras · Mathematics 2010-04-13 Zur Izhakian , John Rhodes , Benjamin Steinberg

Some practical results are derived for population inference based on a sample, under the two qualitative conditions of 'ignorability' and exchangeability. These are the 'Histogram Theorem', for predicting the outcome of a non-sampled member…

Statistics Theory · Mathematics 2015-11-12 Jonathan Rougier

We define twelve variants of a Reifenberg's affine approximation property, which are known to be connected with the singular sets of minimal surfaces. With this motivation we investigate the regularity of the sets possessing these. We…

Metric Geometry · Mathematics 2010-12-21 Amos N. Koeller

This paper presents a systematic study of the prehistory of the traditional subsystems of second-order arithmetic that feature prominently in the reverse mathematics program of Friedman and Simpson. We look in particular at: (i) the long…

History and Overview · Mathematics 2016-12-20 Walter Dean , Sean Walsh

Reversible computation is key in developing new, energy-efficient paradigms, but also in providing forward-only concepts with broader definitions and finer frames of study.Among other fields, the algebraic specification and representation…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-10-26 Clément Aubert

Continuity is one of the most central notions in mathematics, physics, and computer science. An interesting associated topic is decompositions of continuity, where continuity is shown to be equivalent to the combination of two or more weak…

Logic · Mathematics 2024-12-23 Sam Sanders

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…

Logic · Mathematics 2019-02-06 Samuel Coskey , Joel David Hamkins , Russell Miller

Given a finite and non-empty set $X$ and randomly selected specific functions and relations on $X$, we investigate the existence and non-existence of fixed points and reflexive points, respectively. First, we consider the class of…

Discrete Mathematics · Computer Science 2026-05-28 Rudolf Berghammer , Jules Desharnais , Michael Winter

Cayley's theorem tells us that all groups $\mathbf{G}$ occur as subgroups of the group of automorphisms over some set $X$. In this paper we consider a `sort-of' converse to this question: given a set $X$ and some transformation group…

Group Theory · Mathematics 2024-10-02 Peter F. Faul , Zurab Janelideze , Gideo Joubert

There is a natural equivalence relation on representations of the states of a given quantum system in a Hilbert space, two representations being equivalent iff they are related by a unitary transformation. There are two equivalence classes,…

Quantum Physics · Physics 2007-05-23 Robert A. Van Wesep

We start by presenting a theory of finite sets using the approach which is essentially that taken by Whitehead and Russell in Principia Mathematica}, and which does not involve the natural numbers (or any other infinite set). This theory is…

History and Overview · Mathematics 2010-06-22 Chris Preston

The First Hilbert problem is studied in this paper by applying two instruments: a new methodology distinguishing between mathematical objects and mathematical languages used to describe these objects; and a new numeral system allowing one…

General Mathematics · Mathematics 2012-03-20 Yaroslav D. Sergeyev