English
Related papers

Related papers: Arithmetical and Hyperarithmetical Worm Battles

200 papers

Over any non-Archimedean local field of characteristic not equal to $2$, Takeda and Wood constructed types for the two blocks containing the even and odd Weil representations of the metaplectic group $\tilde{G}$, and identified the…

Representation Theory · Mathematics 2024-07-12 Fei Chen , Wen-Wei Li

Let $a_n$ be the random increasing sequence of natural numbers which takes each value independently with probability $n^{-a}$, $0 < a < 1/2$, and let $p(n) = n^{1+\epsilon}$, $0 < \epsilon < 1$. We prove that, almost surely, for every…

Dynamical Systems · Mathematics 2019-06-27 Ben Krause , Pavel Zorin-Kranich

We present a graded modal type theory, a dependent type theory with grades that can be used to enforce various properties of the code. The theory has $\Pi$-types, weak and strong $\Sigma$-types, natural numbers, an empty type, and a…

Logic in Computer Science · Computer Science 2026-05-01 Andreas Abel , Nils Anders Danielsson , Oskar Eriksson

In this paper, we prove the Gallai-Edmonds structure theorem for the most general matching polynomial. Our result implies the Parter-Wiener theorem and its recent generalization about the existence of principal submatrices of a Hermitian…

Combinatorics · Mathematics 2010-06-08 Cheng Yeaw Ku , Kok Bin Wong

The algorithmic theory of randomness is well developed when the underlying space is the set of finite or infinite sequences and the underlying probability distribution is the uniform distribution or a computable distribution. These…

Computational Complexity · Computer Science 2016-08-31 Peter Gacs

The probability distribution P from which the history of our universe is sampled represents a theory of everything or TOE. We assume P is formally describable. Since most (uncountably many) distributions are not, this imposes a strong…

Quantum Physics · Physics 2007-05-23 Juergen Schmidhuber

We consolidate two widely believed conjectures about tautologies -- no optimal proof system exists, and most require superpolynomial size proofs in any system -- into a $p$-isomorphism-invariant condition satisfied by all paddable…

Computational Complexity · Computer Science 2022-07-21 Hunter Monroe

We provide another approach to Friedland's result that the topological entropy $h$ of a symmetric nearest-neighbor subshift is computable. Instead of the previous algebraic technique, our approach is mostly combinatorial and involves only…

Dynamical Systems · Mathematics 2026-05-19 Vuong Bui

The paper is primarily concerned with the asymptotic behavior as $N\to\infty$ of averages of nonconventional arrays having the form $N^{-1}\sum_{n=1}^N\prod_{j=1}^\ell T^{P_j(n,N)}f_j$ where $f_j$'s are bounded measurable functions, $T$ is…

Dynamical Systems · Mathematics 2017-11-30 Yuri Kifer

We prove three switching lemmas, for random restrictions for which variables are set independently; for random restrictions where variables are set in blocks (both due to Hastad [Hastad 86]); and for a distribution appropriate for the…

Computational Complexity · Computer Science 2022-02-14 Neil Thapen

A new generalisation of Goldbach's conjecture (GGC) - also generalising that of Lemoine - is tested, introduced by the first author. It states that for every pair of positive integers $m_1, m_2$, every sufficiently large integer $n$…

General Mathematics · Mathematics 2023-04-04 Zsófia Juhász , Máté Bartalos , Péter Magyar , Gábor Farkas

Let $G_n=\mathrm{GL}_n(F)$ be the general linear group over a non-Archimedean local field $F$. We formulate and prove a necessary and sufficient condition on determining when \[ \mathrm{Hom}_{G_n}(\pi, \pi') \neq 0 \] for irreducible smooth…

Representation Theory · Mathematics 2023-05-26 Kei Yuen Chan

We study binary hypothesis testing for i.i.d. observations under a multiplicative context weight. For the optimal weighted total loss, defined as the sum of weighted type-I and type-II losses, we prove the logarithmic asymptotic $$ L_n^* =…

Statistics Theory · Mathematics 2026-05-12 Mark Kelbert , El'mira Yu. Kalimulina

We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…

Logic in Computer Science · Computer Science 2010-10-15 Marie Ferbus-Zanda , Serge Grigorieff

Following the work of Lloyd Shapley on the Shapley value, and tangentially the work of Guillermo Owen, we offer an alternative non-probabilistic formulation of part of the work of Robert J. Weber in his 1978 paper "Probabilistic values for…

Theoretical Economics · Economics 2019-05-13 Jacob North Clark , Stephen Montgomery-Smith

We give a short and direct proof of the $\lambda_g$-Conjecture. The approach is through the Ekedahl-Lando-Shapiro-Vainshtein theorem, which establishes the ``polynomiality'' of Hurwitz numbers, from which we pick off the lowest degree…

Algebraic Geometry · Mathematics 2007-05-23 Ian P. Goulden , David M. Jackson , Ravi Vakil

Glivenko's theorem says that, in propositional logic, classical provability of a formula entails intuitionistic provability of double negation of that formula. We generalise Glivenko's theorem from double negation to an arbitrary nucleus,…

Logic in Computer Science · Computer Science 2021-12-30 Giulio Fellin , Peter Schuster

We investigate real eigenvalues of real elliptic Ginibre matrices of size $n$, indexed by the parameter of asymmetry $\tau \in [0,1]$. In both the strongly and weakly non-Hermitian regimes, where $\tau \in [0,1)$ is fixed or…

Probability · Mathematics 2025-10-27 Gernot Akemann , Sung-Soo Byun , Yong-Woo Lee

Many representation schemes combining first-order logic and probability have been proposed in recent years. Progress in unifying logical and probabilistic inference has been slower. Existing methods are mainly variants of lifted variable…

Artificial Intelligence · Computer Science 2012-02-20 Vibhav Gogate , Pedro Domingos

We formulate and prove an analog of Poonen's finite-field Bertini theorem with Taylor conditions that holds in the Grothendieck ring of varieties. This gives a broad generalization of the work of Vakil-Wood, who treated the case of smooth…

Algebraic Geometry · Mathematics 2019-10-14 Margaret Bilu , Sean Howe