English
Related papers

Related papers: A Note on Superamorphous Sets and Dual Dedekind-In…

200 papers

We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…

Category Theory · Mathematics 2025-12-23 Clémence Chanavat , Amar Hadzihasanovic

We give examples of rank-one transformations that are (weak) doubly ergodic and rigid (so all their cartesian products are conservative), but with non-ergodic $2$-fold cartesian product. We give conditions for rank-one infinite…

Dynamical Systems · Mathematics 2016-10-20 Isaac Loh , Cesar E. Silva

We consider a new kind of interpretation over relational structures: finite sets interpretations. Those interpretations are defined by weak monadic second-order (WMSO) formulas with free set variables. They transform a given structure into…

Logic in Computer Science · Computer Science 2017-01-11 Thomas Colcombet , Christof Löding

In this article we consider alternative definitions-descriptions of a set being Infinite within the primitive Axiomatic System of Zermelo.

Logic · Mathematics 2015-09-03 George Chailos

Examples are given of profinite groups that are not strongly complete, and have other `bad' properties, yet have only finitely many open subgroups of each finite index. It is shown that a profinite group with the latter property must be…

Group Theory · Mathematics 2021-03-31 Dan Segal

We study word structures of the form $(D,<,P)$ where $D$ is either $\mathbb{N}$ or $\mathbb{Z}$, $<$ is the natural linear ordering on $D$ and $P\subseteq D$ is a predicate on $D$. In particular we show: (a) The set of recursive…

Logic in Computer Science · Computer Science 2023-06-22 Dietrich Kuske , Jiamou Liu , Anastasia Moskvina

In constructive mathematics, several nonequivalent notions of finiteness exist. In this paper, we continue the study of Noetherian sets in the dependently typed setting of the Agda programming language. We want to say that a set is…

Logic in Computer Science · Computer Science 2016-04-06 Denis Firsov , Tarmo Uustalu , Niccolò Veltri

We show that many classical decision problems about 1-counter omega-languages, context free omega-languages, or infinitary rational relations, are $\Pi_2^1$-complete, hence located at the second level of the analytical hierarchy, and…

Logic in Computer Science · Computer Science 2009-08-04 Olivier Finkel

Whenever a mathematical proposition to be proved requires more information than it is contained in an axiomatic system, it can neither be proved nor disproved, i.e. it is undecidable, or logically undetermined, within this axiomatic system.…

Quantum Physics · Physics 2009-12-06 Caslav Brukner

Suppose $\Gamma$ is a finite simple graph. If $D$ is a dominating set of $\Gamma$ such that each $x\in D$ is contained in the set of vertices of an odd cycle of $\Gamma$, then we say that $D$ is an odd dominating set for $\Gamma$. For a…

Group Theory · Mathematics 2020-03-09 Mahdi Ebrahimi

The superextension $\lambda(X)$ of a set $X$ consists of all maximal linked families on $X$. Any associative binary operation $*: X\times X \to X$ can be extended to an associative binary operation $*:…

Group Theory · Mathematics 2020-04-09 Taras Banakh , Volodymyr Gavrylkiv

We prove that an abstract (possibly infinite dimensional) complex irreducible representation of a discrete supersolvable group is monomial if and only if it has finite weight. We also prove a general result that implies converse of Schur's…

Representation Theory · Mathematics 2016-08-30 E. K. Narayanan , Pooja Singla

We define a class of languages of infinite words over infinite alphabets, and the corresponding automata. The automata used for recognition are a generalisation of deterministic Muller automata to the setting of nominal sets. Remarkably,…

Formal Languages and Automata Theory · Computer Science 2013-10-16 Vincenzo Ciancia , Matteo Sammartino

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

Let $ x $ be an element of a finite group $ G $ and denote the order of $ x $ by $ \mathrm{ord}(x) $. We consider a finite group $ G $ such that $ \gcd(\mathrm{ord}(x),\mathrm{ord}(y))\leqslant 2 $ for any two vanishing elements $ x $ and $…

Group Theory · Mathematics 2021-06-30 Sesuai Y. Madanha , Bernardo G. Rodrigues

We study the nonsymmetric Macdonald polynomials specialized at infinity from various points of view. First, we define a family of modules of the Iwahori algebra whose characters are equal to the nonsymmetric Macdonald polynomials…

Representation Theory · Mathematics 2017-12-11 Evgeny Feigin , Syu Kato , Ievgen Makedonskyi

We give extensive characterizations for an open subset of an affine space of arbitrary dimension, resp. of an inverse limit of prime spectra to be quasi-compact. Among other things weak stability, retro-compactness, and cylinder sets…

Algebraic Geometry · Mathematics 2026-04-10 A. Bernhard Zeidler

Given an action of a group $\Gamma$ on a measure space $\Omega$, we provide a sufficient criterion under which two sets $A, B\subseteq \Omega$ are measurably equidecomposable, i.e., $A$ can be partitioned into finitely many measurable…

Metric Geometry · Mathematics 2023-08-21 Łukasz Grabowski , András Máthé , Oleg Pikhurko

We argue that the finiteness of quantum gravity amplitudes in fully compactified theories (at least in supersymmetric cases) leads to a bottom-up prediction for the existence of non-trivial dualities. In particular, finiteness requires the…

High Energy Physics - Theory · Physics 2025-08-20 Matilda Delgado , Damian van de Heisteeg , Sanjay Raman , Ethan Torres , Cumrun Vafa , Kai Xu

A homogeneous family of subsets over a given set is one with a very ``rich'' automorphism group. We prove the existence of a bi-universal element in the class of homogeneous families over a given infinite set and give an explicit…

Logic · Mathematics 2009-09-25 Menachem Kojman , Saharon Shelah