Related papers: Taking Reinhardt's Power Away

This paper is devoted to a weighted version of the one-level density of the non-trivial zeros of $L$-functions, tilted by a power of the $L$-function evaluated at the central point. Assuming the Riemann Hypothesis and the ratio conjecture,…

Measuring the quality of a generated sequence against a set of references is a central problem in many learning frameworks, be it to compute a score, to assign a reward, or to perform discrimination. Despite great advances in model…

The disjoint amalgamation property (DAP), which asserts that all spans of a class of models can be amalgamated with minimal intersection, is an important property in the context of abstract elementary classes, with connections to both…

We consider several types of non-existence theorems for functors. For example, there are no nontrivial functors from the category of groups (or the category of pointed sets, or vector spaces) to any small category. Another type of questions…

Low-dimensional representations, or embeddings, of a graph's nodes facilitate several practical data science and data engineering tasks. As such embeddings rely, explicitly or implicitly, on a similarity measure among nodes, they require…

Using an invariant modification of Jensen's "minimal $\varPi^1_2$ singleton" forcing, we define a model of ZFC, in which, for a given $n\ge2$, there exists a lightface $\varPi^1_n$ unordered pair of non-OD (hence, OD-indiscernible)…

For a countable, weakly minimal theory, we show that the Schroeder-Bernstein property (any two elementarily bi-embeddable models are isomorphic) is equivalent to both a condition on orbits of rank 1 types and the property that the theory…

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

Representation learning on graphs has been gaining attention due to its wide applicability in predicting missing links, and classifying and recommending nodes. Most embedding methods aim to preserve certain properties of the original graph…

The set-theoretic large cardinal axiom known as I3 posits the existence of a non-trivial rank-to-rank embedding from an initial segment of the universe of sets into itself. Laver showed that the algebra generated by a single such embedding…

We extend some classical constructions in commutative algebra to the setting of modules over orders in (non-commutative) semisimple algebras. Our theory incorporates, inter alia, `reduced' versions of the notions of higher Fitting…

Motivated by topological Tverberg-type problems and by classical results about embeddings (maps without double points), we study the question whether a finite simplicial complex K can be mapped into R^d without triple, quadruple, or, more…

We present a short proof of Jin's theorem which is entirely elementary, in the sense that no use is made of nonstandard analysis, ergodic theory, measure theory, ultrafilters, or other advanced tools. The given proof provides the explicit…

In this article we adapt the existing account of class-forcing over a ZFC model to a model $(M,\mathcal{C})$ of Morse-Kelley class theory. We give a rigorous definition of class-forcing in such a model and show that the Definability Lemma…

The existence of a countably compact group without non-trivial convergent sequences in ZFC alone is a major open problem in topological group theory. We give a ZFC example of a Boolean topological group G without non-trivial convergent…

In this article, we study a convex embedding for the Euler problem of two fixed centers for energies below the critical energy level. We prove that the doubly-covered elliptic coordinates provide a 2-to-1 symplectic embedding such that the…

Vector embeddings have been tasked with an ever-increasing set of retrieval tasks over the years, with a nascent rise in using them for reasoning, instruction-following, coding, and more. These new benchmarks push embeddings to work for any…

We show that there is a $\beta$-model of second-order arithmetic in which the choice scheme holds, but the dependent choice scheme fails for a $\Pi^1_2$-assertion, confirming a conjecture of Stephen Simpson. We obtain as a corollary that…

This paper presents primarily two Euclidean embeddings of the quotient space generated by matrices that are identified modulo arbitrary row permutations. The original application is in deep learning on graphs where the learning task is…

In this paper, we study conditions for the existence of an embedding $\widetilde{f} \colon P \to Q \times \mathbb{R}$ such that $f = \mathrm{pr}_Q \circ \widetilde{f}$, where $f \colon P \to Q$ is a piecewise linear map between polyhedra.…