English
Related papers

Related papers: Transcendental pairs of generic extensions

200 papers

We deal with consistency results for the existence of universal models in natural classes of models (more exactly--a somewhat weaker version). We apply a result on quite general family to T_feq and to the class of triangle-free graphs.

Logic · Mathematics 2016-09-06 Saharon Shelah

We continue the work of [1, 2, 3] by analyzing the equivalence relation of bi-embeddability on various classes of countable planes, most notably the class of countable non-Desarguesian projective planes. We use constructions of the second…

Logic · Mathematics 2020-10-16 Filippo Calderoni , Gianluca Paolini

We derive a forcing axiom from the conjunction of square and diamond, and present a few applications, primary among them being the existence of super-Souslin trees. It follows that for every uncountable cardinal $\lambda$, if $\lambda^{++}$…

Logic · Mathematics 2019-08-15 Chris Lambie-Hanson , Assaf Rinot

This work demonstrates classical generation is preserved by the derived pushforward along the structure morphism of a noncommutative coherent algebra to its underlying scheme. Additionally, we establish that the Krull dimension of a variety…

Algebraic Geometry · Mathematics 2025-03-26 Anirban Bhaduri , Souvik Dey , Pat Lank

A classical result of Euler states that the tangent numbers are an alternating sum of Eulerian numbers. A dual result of Roselle states that the secant numbers can be obtained by a signed enumeration of derangements. We show that both…

Combinatorics · Mathematics 2017-09-13 Matthieu Josuat-Vergès

In this paper we introduce probability-preserving convolution algebras on cones of positive semidefinite matrices over one of the division algebras $\b F = \b R, \b C$ or $\b H$ which interpolate the convolution algebras of radial bounded…

Classical Analysis and ODEs · Mathematics 2014-05-14 Margit Rösler

This is the first of a series of papers that develop a systematic bridge between constructions in discrete mathematics and the corresponding continuous analogs. In this paper, we establish an equivalence between Forman's discrete Morse…

Combinatorics · Mathematics 2022-02-10 Jürgen Jost , Dong Zhang

We prove the s-positivity of the chromatic functions of interval hypergraphs and a conjecture of Taylor~\cite{Taylor15} as a consequence. We also give a new proof of Gasharov's theorem on the s-positivity of the chromatic symmetric…

Combinatorics · Mathematics 2015-08-13 Alexander Paunov

We develop a general framework for forcing with coherent adequate sets on $H(\lambda)$ as side conditions, where $\lambda \ge \omega_2$ is a cardinal of uncountable cofinality. We describe a class of forcing posets which we call coherent…

Logic · Mathematics 2014-06-13 John Krueger , Miguel Angel Mota

In this article we establish two fundamental results for the sublevel set persistent homology for stationary processes indexed by the positive integers. The first is a strong law of large numbers for the persistence diagram (treated as a…

Probability · Mathematics 2025-08-22 Andrew M. Thomas

In this note we prove that the Borel class of representations of 3-manifold groups to PGL(n,C) is preserved under Cartan involution up to sign. For representations to PGL(3,C) this is implied by a more general result of E. Falbel and Q.…

Geometric Topology · Mathematics 2017-12-01 Thilo Kuessner

We establish two versions of Vizing's theorem for Borel multi-graphs whose vertex degrees and edge multiplicities are uniformly bounded by respectively $\Delta$ and $\pi$. The ``approximate'' version states that, for any Borel probability…

Combinatorics · Mathematics 2020-07-21 Jan Grebík , Oleg Pikhurko

In this article we proved so-called strong reflection principles corresponding to formal theories Th which has omega-models. An posible generalization of the Lob's theorem is considered.Main results is: (1) let $k$ be an inaccessible…

General Mathematics · Mathematics 2019-10-08 Jaykov Foukzon

In this paper we introduce the concepts of the distinguishing number and the distinguishing chromatic number of a poset. For a distributive lattice $L$ and its set $Q_L$ of join-irreducibles, we use classic lattice theory to show that any…

Combinatorics · Mathematics 2020-07-10 Karen L. Collins , Ann N. Trenk

Let $G$ be an acylindrically hyperbolic group. We prove that Bernoulli bond percolation on every Cayley graph of $G$ has a nonuniqueness phase, in which there are infinitely many infinite clusters. This generalizes Hutchcroft's result for…

Group Theory · Mathematics 2025-08-14 Inhyeok Choi , Donggyun Seo

We consider a new class of perturbation expansions, which incorporate in a systematic way the available information about the divergent character of the perturbation series in QCD. The new expansion functions, which replace the powers of…

High Energy Physics - Phenomenology · Physics 2015-03-17 Irinel Caprini , Jan Fischer

The forcing method is a powerful tool to prove the consistency of set-theoretic assertions relative to the consistency of the axioms of set theory. Laver's theorem and Bukovsk\'y's theorem assert that set-generic extensions of a given…

Logic · Mathematics 2016-07-07 Sy David Friedman , Sakaé Fuchino , Hiroshi Sakai

We prove the consistency of the theory ZFC + there is a strongly compact cardinal from the existence of a cardinal preserving embedding from the universe into an inner model. The proof almost shows that under SCH, every cardinal preserving…

Logic · Mathematics 2021-03-02 Gabriel Goldberg

We introduce two classes of novel color superalgebras of $ \mathbb{Z}_2 \times \mathbb{Z}_2 $ grading. This is done by realizing members of each in the universal enveloping algebra of the ${\cal N}=1$ supersymmetric extension of the…

Mathematical Physics · Physics 2019-03-06 N. Aizawa , P. S. Isaac , J. Segar

This paper exposes a contradiction in the Zermelo-Fraenkel set theory with the axiom of choice (ZFC). While Godel's incompleteness theorems state that a consistent system cannot prove its consistency, they do not eliminate proofs using a…

Logic in Computer Science · Computer Science 2017-01-03 Minseong Kim