Related papers: On Mathias generic sets

The Jordan structure of finite-dimensional quantum theory is derived, in a conspicuously easy way, from a few simple postulates concerning abstract probabilistic models (each defined by a set of basic measurements and a convex set of…

We show that every n-by-n matrix is generically a product of [n/2] + 1 Toeplitz matrices and always a product of at most 2n+5 Toeplitz matrices. The same result holds true if the word "Toeplitz" is replaced by "Hankel", and the generic…

Let $\mathcal{A}$ and $\mathcal{B}$ be two algebras, let $\mathcal{M}$ be a $\mathcal{B}$-bimodule and let $n$ be a positive integer. A linear mapping $D_n:\mathcal{A} \rightarrow \mathcal{M}$ is called a strongly generalized derivation of…

We prove two statements about the long time dynamics of integrable Hamiltonian systems. In classical mechanics, we prove the microcanonical version of the Generalized Gibbs Ensemble (GGE) by mapping it to a known theorem and then extend it…

The Hamiltonian formulation of N-bein, Einstein-Cartan, gravity, using its first order form in any dimension higher than two, is analyzed. This Hamiltonian formulation allows to explicitly show where peculiarities of three dimensional case…

We give conjectures on the possible graded Betti numbers of Cohen-Macaulay modules up to multiplication by positive rational numbers. The idea is that the Betti diagrams should be non-negative linear combinations of pure diagrams. The…

Model-theoretic aspects of exotic smoothness were studied long ago uncovering unexpected relations to noncommutative spaces and quantum theory. Some of these relations were worked out in detail in later work. An important point in the…

We introduce a category whose objects are stationary set preserving complete boolean algebras and whose arrows are complete homomorphisms with a stationary set preserving quotient. We show that the cut of this category at a rank initial…

We develop a forcing poset with finite conditions which adds a partial square sequence on a given stationary set, with adequate sets of models as side conditions. We then develop a kind of side condition product forcing for simultaneously…

This is an introduction to the set-theoretic method of forcing, including its application in proving the independence of the Continuum Hypothesis from the Zermelo-Fraenkel axioms of set theory. I presuppose no particular mathematical…

We isolate a combinatorial property of capacities leading to a construction of proper forcings. Then we show that many classical capacities such as the Newtonian capacity satisfy the property.

The question of matrix similarity is a classical one in linear algebra. For a field $\mathbb{F}$ and some positive integer $n \in \mathbb{N}$, one may consider the following problems: 1. Given two matrices $A, B \in \mathrm{GL}(n,…

Gleason's theorem [A. Gleason, J. Math. Mech., \textbf{6}, 885 (1957)] is an important result in the foundations of quantum mechanics, where it justifies the Born rule as a mathematical consequence of the quantum formalism. Formally, it…

Chung, Graham and Wilson defined a set of graphs $\mathcal{H}$ to be forcing, if any sequence of graphs $\{G_n\}_{n \geq 0}$ with $|G_n| = n$ must be quasirandom, whenever $hom(H, G_n)= (p^{|E(H)|}+o(1))n^{|V(H)|}$ for every $H \in…

Let $M$ be a perfect matching in a graph. A subset $S$ of $M$ is said to be a forcing set of $M$, if $M$ is the only perfect matching in the graph that contains $S$. The minimum size of a forcing set of $M$ is called the forcing number of…

We study a class of hypothesis testing problems in which, upon observing the realization of an $n$-dimensional Gaussian vector, one has to decide whether the vector was drawn from a standard normal distribution or, alternatively, whether…

In this paper we demonstrate that the class of basic feasible functionals has recursion theoretic properties which naturally generalize the corresponding properties of the class of feasible functions. We also improve the Kapron - Cook…

We present a new partial order for directly forcing morasses to exist that enjoys a significant homogeneity property. We then use this forcing in a reverse Easton iteration to obtain an extension universe with morasses at every regular…

As machine learning becomes more and more available to the general public, theoretical questions are turning into pressing practical issues. Possibly, one of the most relevant concerns is the assessment of our confidence in trusting machine…

For a finite group $G$, let $N(G)$ denote the set of conjugacy class sizes of $G$. We show that if every finite group $G$ with trivial center such that $N(G)$ equals to $N(Alt_n)$, where $n>1361$ and at least one of numbers $n$ or $n-1$ are…