English
Related papers

Related papers: On Russell typicality in Set Theory

200 papers

We study $T$-designs in the nonbinary Johnson scheme. This scheme generalizes both the Johnson and Hamming schemes and admits a bivariate $Q$-polynomial structure. Zhu (2021) provided a combinatorial characterization of $T$-designs in this…

Combinatorics · Mathematics 2025-12-29 Hiroshi Nozaki , Yuta Watanabe

For $K$ an infinite field of characteristic other than two, consider the action of the special orthogonal group $\operatorname{SO}_t(K)$ on a polynomial ring via copies of the regular representation. When $K$ has characteristic zero,…

Commutative Algebra · Mathematics 2024-08-07 Aldo Conca , Anurag K. Singh , Matteo Varbaro

A serious defect with the Halpern-Pearl (HP) definition of causality is repaired by combining a theory of causality with a theory of defaults. In addition, it is shown that (despite a claim to the contrary) a cause according to the HP…

Artificial Intelligence · Computer Science 2008-12-18 Joseph Y. Halpern

This article has been withdrawn in 2013. The class of LOTS (linearly ordered topological spaces) contains many important spaces, like the set of real numbers, the set of rational numbers and the ordinals. Such spaces have rich topological…

General Topology · Mathematics 2018-03-29 Kyriakos Papadopoulos

We show that if a topological or paratopological group $G$ contains a stationary subset of some regular uncountable cardinal, then $G$ contains a subspace which is not collectionwise normal. This statement implies that if a monotonically…

General Topology · Mathematics 2012-09-24 Raushan Buzyakova , Cetin Vural

We introduce the notion of hereditary G-compactness (with respect to interpretation). We provide a sufficient condition for a poset to not be hereditarily G-compact, which we use to show that any linear order is not hereditarily G-compact.…

Logic · Mathematics 2022-03-11 Tomasz Rzepecki

Hereditarily non uniformly perfect (HNUP) sets were introduced by Stankewitz, Sugawa, and Sumi in \cite{SSS} who gave several examples of such sets based on Cantor set-like constructions using nested intervals. For non-autonomous iteration…

Dynamical Systems · Mathematics 2025-07-18 Mark Comerford , Hiroki Sumi

Hadwiger's theorem is a Helly-type theorem involving common transversals to families of convex sets instead of common intersections. Subsequently, Pollack and Wenger identified a necessary and sufficient condition, called a consistent…

Combinatorics · Mathematics 2025-12-03 Ilani Axelrod-Freed , João Pedro Carvalho , Yuki Takahashi

This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…

Logic · Mathematics 2026-04-07 Ali Enayat

We show that for a wide class of groups of finite Morley rank the presence of a split $BN$-pair of Tits rank $1$ forces the group to be of the form $\operatorname{PSL}_2$ and the $BN$-pair to be standard. Our approach is via the theory of…

Group Theory · Mathematics 2014-02-12 Joshua Wiscons

In a set equipped with a binary operation, (S,*), a subset U is defined to be avoidable if there exists a partition {A,B} of S such that no element of U is the product of two distinct elements of A or of two distinct elements of B. For more…

Combinatorics · Mathematics 2007-05-23 Mike Develin

We study non-abelian gauge theories with fermions in a representation such that the surviving electric 1-form symmetry is $\mathbb{Z}_2$. This includes $SU(N)$ gauge theories with matter in the (anti)symmetric and $N$ even, and $USp(2N)$…

High Energy Physics - Theory · Physics 2023-09-18 Riccardo Argurio , Romain Vandepopeliere

For a ring R, Hilbert's Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R. We consider computability of this set for subrings R of the rationals. Applying Baire category theory to…

Logic · Mathematics 2016-02-11 Russell Miller

The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…

Discrete Mathematics · Computer Science 2025-09-17 Ben Young

Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…

Logic · Mathematics 2025-11-25 Sy-David Friedman , Tapani Hyttinen , Vadim Kulikov

A definable set $X$ in the first-order language of rings defines a family of random vectors: for each finite field $\mathbb{F}_q$, let the distribution be supported and uniform on the $\mathbb{F}_q$-rational points of $X$. We employ results…

Information Theory · Computer Science 2025-02-28 Tobias Boege

We give an accessible presentation to the foundations of nominal techniques, lying between Zermelo-Fraenkel set theory and Fraenkel-Mostowski set theory, and which has several nice properties including being consistent with the Axiom of…

Logic in Computer Science · Computer Science 2020-01-23 Murdoch J. Gabbay

A Taylor variety consists of all fixed order Taylor polynomials of rational functions, where the number of variables and degrees of numerators and denominators are fixed. In one variable, Taylor varieties are given by rank constraints on…

Algebraic Geometry · Mathematics 2023-04-04 Aldo Conca , Simone Naldi , Giorgio Ottaviani , Bernd Sturmfels

We study the WZNW models based on nonstandard bilinear forms. We approach the problem from algebraic, perturbative and functional exact methods. It is shown that even in the case of integer $k$ we can find irrational CFT's. We prove that…

High Energy Physics - Theory · Physics 2015-06-26 H. Arfaei , S. Parvizi

A set $A$ is dually Dedekind finite if every surjection from $A$ onto $A$ is injective; otherwise, $A$ is dually Dedekind infinite. An amorphous set is an infinite set that cannot be partitioned into two infinite subsets. A strictly…

Logic · Mathematics 2025-10-16 Yifan Hu , Ruihuan Mao , Guozhen Shen