English
Related papers

Related papers: Perfect set dichotomy theorem in generalized Solov…

200 papers

We prove that many seemingly simple theories have Borel complete reducts. Specifically, if a countable theory has uncountably many complete 1-types, then it has a Borel complete reduct. Similarly, if $Th(M)$ is not small, then $M^{eq}$ has…

Logic · Mathematics 2021-09-21 Michael C. Laskowski , Douglas S. Ulrich

We study connections between linear equations over various semigroups and recursively enumerable sets of positive integers. We give variants of the universal Diophantine representation of recursively enumerable sets of positive integers…

Formal Languages and Automata Theory · Computer Science 2024-06-04 Juha Honkala

We study a notion of indecomposability in differential algebraic groups which is inspired by both model theory and differential algebra. After establishing some basic definitions and results, we prove an indecomposability theorem for…

Logic · Mathematics 2014-10-24 James Freitag

Let $G$ be an undirected graph. An edge of $G$ dominates itself and all edges adjacent to it. A subset $E'$ of edges of $G$ is an edge dominating set of $G$, if every edge of the graph is dominated by some edge of $E'$. We say that $E'$ is…

Discrete Mathematics · Computer Science 2017-05-24 Min Chih Lin , Vadim Lozin , Veronica A. Moyano , Jayme L. Szwarcfiter

We investigate whether the group algebra of a finite group over a localisation of the integers is semiperfect. The main result is a necessary and sufficient arithmetic criterion in the ordinary case. In the modular case, we propose a…

Rings and Algebras · Mathematics 2025-10-10 Dylan Johnston , Dmitriy Rumynin

The semidirect product $\mathbb{G}=\mathbb{L}\rtimes \mathbb{K}$ attached to a compact-group action on a connected, simply-connected solvable Lie group has a dense set of compact elements precisely when the $s\in \mathbb{K}$ operating on…

Group Theory · Mathematics 2025-07-08 Alexandru Chirvasitu

We prove a complexity dichotomy theorem for a class of Holant problems on planar 3-regular bipartite graphs. The complexity dichotomy states that for every weighted constraint function $f$ defining the problem (the weights can even be…

Computational Complexity · Computer Science 2023-03-30 Jin-Yi Cai , Austen Z. Fan

This is both an expository and research paper where we advocate a systematic study of continuous analogues of finite partially ordered sets, convex polytopes, oriented matroids, arrangements of subspaces, finite simplicial complexes, and…

Combinatorics · Mathematics 2016-03-29 Rade T. Živaljević

We establish Liouville type theorems for elliptic systems with various classes of non-linearities on $\mathbb{R}^N$. We show among other things, that a system has no semi-stable solution in any dimension, whenever the infimum of the…

Analysis of PDEs · Mathematics 2011-11-23 Mostafa Fazly

A classical result of Kaufman states that, for each $\tau>1,$ the set of well approximable numbers \[ E(\tau)=\{x\in\mathbb{R}: \|qx\| < |q|^{-\tau} \text{ for infinitely many integers q}\} \] is a Salem set with Hausdorff dimension…

Number Theory · Mathematics 2021-09-24 Kyle Hambrook , Han Yu

We extend Ueda's peak set theorem for subdiagonal subalgebras of tracial finite von Neumann algebras, to sigma-finite von Neumann algebras (that is, von Neumann algebras with a faithful state; which includes those on a separable Hilbert…

Operator Algebras · Mathematics 2018-08-09 David P. Blecher , Louis Labuschagne

We investigate the integrability and non-integrability of isotropic spin chains with nearest-neighbor interaction with general spin $S$ in terms of the presence or absence of local conserved quantities. We prove a dichotomy theorem that…

Statistical Mechanics · Physics 2025-07-28 Naoto Shiraishi , Mizuki Yamaguchi

Various theorems for the preservation of set-theoretic axioms under forcing are proved, regarding both forcing axioms and axioms true in the Levy-Collapse. These show in particular that certain applications of forcing axioms require to add…

Logic · Mathematics 2007-05-23 Bernhard Koenig

We show that if A is a linear order then Th(A) is either $\aleph_0$-categorical or Borel complete (in the sense of Friedman and Stanley). We generalize this; if A has countably many unary predicates attached, then Th(A) is…

Logic · Mathematics 2016-04-01 Richard Rast

We show that for any infinite set $A$ in ${\mathbb R}$, there exists a compact set $E \subseteq \mathbb{R}$ of positive Lebesgue measure that does not contain any non-trivial affine copy of $A$. This proves the Erd\"os similarity…

Classical Analysis and ODEs · Mathematics 2020-01-14 Angel Cruz , Chun-Kit Lai , Malabika Pramanik

We show from a weak comparison principle (the Ultrapower Axiom) that the Mitchell order is linear on certain kinds of ultrafilters: normal ultrafilters, Dodd solid ultrafilters, and assuming GCH, generalized normal ultrafilters. In the…

Logic · Mathematics 2017-07-05 Gabriel Goldberg

In this paper, we obtain the consistency, relative to large cardinals, of the existence of dense ideals on every successor of a regular cardinal simultaneously. Using a consequent transfer principle, we show that in this model there is a…

Logic · Mathematics 2024-10-21 Monroe Eskew , Yair Hayut

A balanced pair in a finite ordered set $P=(V,\leq)$ is a pair $(x,y)$ of elements of $V$ such that the proportion of linear extensions of $P$ that put $x$ before $y$ is in the real interval $[1/3, 2/3]$. We prove that every finite $N$-free…

Combinatorics · Mathematics 2012-05-22 Imed Zaguia

A topological space TO(S) of total orderings on any given set S is introduced and it is shown that TO(S) is compact if S is countable. The set NO(N) of all normal orderings of the nth Weyl algebra W is a closed subspace of TO(N), where N is…

Rings and Algebras · Mathematics 2011-06-02 Roberto Boldini

Let P be a distinguished unary predicate and K= {M: M a model of cardinality aleph_n with P^M of cardinality aleph_0}. We prove that consistently for n=4, for some countable first order theory T we have: T has no model in K whereas every…

Logic · Mathematics 2007-05-23 Saharon Shelah