Related papers: Taking Reinhardt's Power Away

Elements of the Riordan group $\cal R$ over a field $\mathbb F$ of characteristic zero are infinite lower triangular matrices which are defined in terms of pairs of formal power series. We wish to bring to the forefront, as a tool in the…

We show that $\mathbf{C}$, a weak theory of sets with Axiom Beta, proves the scheme of Elementary, or $\Delta_0$ Transfinite Recursion and can generate, for every set, the corresponding relativized constructible hierarchy. We show that the…

We show that the order three algebraic differential equation over ${\mathbb Q}$ satisfied by the analytic $j$-function defines a non-$\aleph_0$-categorical strongly minimal set with trivial forking geometry relative to the theory of…

We classify all pairs (G,V) with G a closed subgroup in a classical group with natural module V over the complex numbers such that G has the same composition factors on the kth tensor power of V, for a fixed (small) k. In particular, we…

We deal with some aspects of the theory of conformal embeddings of affine vertex algebras, providing a new proof of the Symmetric Space Theorem and a criterion for conformal embeddings of equal rank subalgebras. We finally study some…

Jech proved that every partially ordered set can be embedded into the cardinals of some model of $ZF$. We extend this result to show that every partially ordered set can be embedded into the cardinals of some model of $ZF+DC_{<\kappa}$ for…

Assume $X$ is a variety over $\mathbb{C}$, $A \subseteq \mathbb{C}$ is a finitely generated $\mathbb{Z}$-algebra and $X_A$ a model of $X$ (i.e. $X_A \times_A \mathbb{C} \cong X$). Assuming the weak ordinarity conjecture we show that there…

The aim of these lectures is to give a short introduction to forcing. We will avoid metamathematical issues as much as possible and similarly we will avoid performing the actual construction of forcing. We assume familiarity with basic…

This work provides the first unifying theoretical framework for node (positional) embeddings and structural graph representations, bridging methods like matrix factorization and graph neural networks. Using invariant theory, we show that…

Assuming a large cardinal hypothesis, Laver gave a representation of the monogenerated free left distributive algebra (LDA) using elementary embeddings and used this representation to prove many algebraic results. Some of these results were…

The consistency of a learning method is usually established under the assumption that the observations are a realization of an independent and identically distributed (i.i.d.) or mixing process. Yet, kernel methods such as support vector…

We show that the following two theories are equiconsistent: (T) ZFC, CH and "There is a dense ideal on the first uncountable cardinal such that if j is the generic embedding associated with it then its restriction on ordinals is independent…

If $N \subset P,Q \subset M$ are type II_1 factors with $N' \cap M = C id$ and $[M:N]$ finite we show that restrictions on the standard invariants of the elementary inclusions $N \subset P$, $N \subset Q$, $P \subset M$ and $Q \subset M$…

We provide a framework for exploring physics beyond the Standard Model with reinforcement learning using graph representations of new physics theories. The graph structure allows for model-building without a priori specifying definite…

The field of deep visual recognition is undergoing a paradigm shift toward universal representations. The Platonic Representation Hypothesis suggests that diverse architectures trained on massive datasets are converging toward a shared,…

Let GCH hold and let $j:V\longrightarrow M$ be a definable elementary embedding such that $crit(j)=\kappa$, $^{\kappa}M\subseteq M$ and $\kappa^{++}=\kappa_{M}^{++}$. H. Woodin proved that there is a cofinality preserving generic extension…

We prove that, consistently with ZFC, no ultraproduct of countably infinite (or separable metric, non-compact) structures is isomorphic to a reduced product of countable (or separable metric) structures associated to the Fr\'echet filter.…

An ordinary voltage graph embedding of a graph in a surface encodes a certain kind of highly symmetric covering space of that surface. Given an ordinary voltage graph embedding of a graph $G$ in a surface with voltage group $A$ and a…

Compositionally complex solid solution electrocatalysts span vast composition spaces, and even one materials system can contain more candidate compositions than can be measured exhaustively. Here we evaluate a label-free screening strategy…

The technique of symmetric extensions is derived from forcing and it is one of the most important tools for studying models without the Axiom of Choice. Despite being incredibly successful since the 1960s, our understanding of the technique…