Related papers: Combinatorial principles equivalent to weak induct…
Automated theorem proving in first-order logic is an active research area which is successfully supported by machine learning. While there have been various proposals for encoding logical formulas into numerical vectors -- from simple…
We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…
The weak equivalence principle is studied in a space with noncommutativity of coordinates and noncommutativity of momenta. We find conditions on the parameters of noncommutativity which give the possibility to recover the equivalence…
We prove a conjecture about mininmal index of certain representations of Coset Algebraic Conformal Field Theories under general conditions as formulated previously by us. As a by-product, the Kac-Wakimoto Conjecture (KWC) which is related…
The reflection principle is the statement that if a sentence is provable then it is true. Reflection principles have been studied for first-order theories, but they also play an important role in propositional proof complexity. In this…
We propose tests of the weak equivalence principle (WEP) using a torsion balance, in which superposition of energy eigenstates are created in a controllable way for the test masses. After general considerations on the significance of tests…
In scenarios of strongly coupled electroweak symmetry breaking, heavy composite particles of different spin and parity may arise and cause observable effects on signals that appear at loop levels. The recently observed process of Higgs to…
We prove, and mechanize in Rocq, an abstract obstruction theorem for primitive closure predicates, defined as $C : \mathsf{Form} \to \mathsf{Prop}$ over the closed implication-falsity fragment $A,B ::= \bot \mid A \to B$. Two structurally…
In recent years the question of whether adding the limited principle of omniscience, LPO, to constructive Zermelo-Fraenkel set theory, CZF, increases its strength has arisen several times. As the addition of excluded middle for atomic…
Concurrent systems are notoriously difficult to analyze, and technological advances such as weak memory architectures greatly compound this problem. This has renewed interest in partial order semantics as a theoretical foundation for formal…
Consider a 2D composites with non-overlapping equal inclusions imbedded in a host material of the normalized unit conductivity. The conductivity of inclusions takes two values $\sigma_1$ and $\sigma_2$ with the probabilities $p$ and $1-p$,…
We prove strengthenings of the Birkhoff Ergodic Theorem for weakly mixing and strongly mixing measure preserving systems. We show that our pointwise theorem for weakly mixing systems is strictly stronger than the Wiener-Wintner Theorem. We…
In condensed matter systems, coherent backscattering and quantum interference in the presence of time-reversal symmetry lead to well-known phenomena such as weak localization (WL) and universal conductance fluctuations (UCF). Here we use…
Recently, the Elementary Process Theory (EPT) has been developed as a set of fundamental principles that might underlie a gravitational repulsion of matter and antimatter. This paper presents set matrix theory (SMT) as the foundation of the…
We prove conservativity results for weak K\H{o}nig's lemma that extend the celebrated result of Harrington (for $\Pi^1_1$-statements) and are somewhat orthogonal to the extension by Simpson, Tanaka and Yamazaki (for statements of the form…
Representing a proof tree by a combinator term that reduces to the tree lets subtle forms of duplication within the tree materialize as duplicated subterms of the combinator term. In a DAG representation of the combinator term these…
A new perturbational approach to spectral and thermal properties of strongly correlated electron systems is presented: The Anderson model is reexamined for $U\to\infty$\,, and it is shown that an expansion of Green's functions with respect…
We prove that orthogonal constructor term rewrite systems and lambda-calculus with weak (i.e., no reduction is allowed under the scope of a lambda-abstraction) call-by-value reduction can simulate each other with a linear overhead. In…
There is recent interest in compressing data sets for non-sequential settings, where lack of obvious orderings on their data space, require notions of data equivalences to be considered. For example, Varshney & Goyal (DCC, 2006) considered…
Data integration methods aim to extract low-dimensional embeddings from high-dimensional outcomes to remove unwanted variations, such as batch effects and unmeasured covariates, across heterogeneous datasets. However, multiple hypothesis…