English
Related papers

Related papers: David's trick

200 papers

Given a $\Gamma$-semigroup $S$, we construct a semigroup $\Sigma$ in such a way that one sided ideals and quasi-ideals of $S$ can be regarded as one sided ideals and quasi-ideals respectively of $\Sigma$. This correspondence and other…

Group Theory · Mathematics 2013-04-17 Elton Pasku

Uniqueness quantification ($\exists !$) is a quantifier in first-order logic where one requires that exactly one element exists satisfying a given property. In this paper we investigate the strength of uniqueness quantification when it is…

Computational Complexity · Computer Science 2019-06-18 Victor Lagerkvist , Gustav Nordh

In the first part of this paper we present a formalization in Agda of the James construction in homotopy type theory. We include several fragments of code to show what the Agda code looks like, and we explain several techniques that we used…

Logic in Computer Science · Computer Science 2017-10-31 Guillaume Brunerie

A strong direct product theorem (SDPT) states that solving n instances of a problem requires Omega(n) times the resources for a single instance, even to achieve success probability exp(-Omega(n)). We prove that quantum communication…

Computational Complexity · Computer Science 2010-11-23 Alexander A. Sherstov

Theorem: Let $n\ge 2.$ There is a CCC in $L$ forcing notion $P=P_n\in L$ such that $P$-generic extensions of $L$ are of the form $L[a],$ where $a\subseteq\omega$ and 1) $a$ is $\Delta^1_{n+1}$ in $L[a]$; and 2) if $b\in L[a],$…

Logic · Mathematics 2020-01-01 Vladimir Kanovei

In a recent paper, the second author and Joana Cirici proved a theorem that says that given appropriate hypotheses, $n$-formality of a differential graded algebraic structure is equivalent to the existence of a chain-level lift of a…

Algebraic Topology · Mathematics 2022-09-23 Gabriel C. Drummond-Cole , Geoffroy Horel

We prove a general theorem on overpartitions with difference conditions that unifies generalisations of Schur's theorem due to Alladi-Gordon, Andrews, Corteel-Lovejoy and the author. This theorem also allows one to give companions and…

Combinatorics · Mathematics 2016-07-01 Jehanne Dousse

Assuming the obvious definitions (see paper) we show the a decidable model that is effectively prime is also effectively atomic. This implies that two effectively prime (decidable) models are computably isomorphic. This is in contrast to…

Logic · Mathematics 2017-01-31 Peter Cholak , Charlie McCoy

We give the most general conditions to date which lead to uniqueness of the general relativistic Hamiltonian. Namely, we show that all spatially covariant generalizations of the scalar constraint which extend the standard one while…

Mathematical Physics · Physics 2016-12-01 Henrique Gomes , Vasudev Shyam

Let p be a prime number and f an overconvergent p-adic automorphic form on a definite unitary group which is split at p. Assume that f is of "classical weight" and that its Galois representation is crystalline at places dividing p, then f…

Number Theory · Mathematics 2023-04-25 Christophe Breuil , Eugen Hellmann , Benjamin Schraen

Undecidability of various properties of first order term rewriting systems is well-known. An undecidable property can be classified by the complexity of the formula defining it. This gives rise to a hierarchy of distinct levels of…

Logic in Computer Science · Computer Science 2009-03-02 Joerg Endrullis , Herman Geuvers , Hans Zantema

We give an abstract approach to the results of Adams and Nobel, [1]. It allows to exhibit a new property of VC classes. It should be stressed that the basic ideas of proofs can be found in [1].

Probability · Mathematics 2012-11-22 Stanislaw Kwapien

In earlier works on Shape Dynamics (SD), a linear method of solving a particular set of Lichnerowicz-type equations through the implicit function theorem was developed in order to implicitly construct SD's global Hamiltonian and eliminate…

General Relativity and Quantum Cosmology · Physics 2012-01-23 Henrique Gomes

We prove a 2-categorical analogue of a classical result of Drinfeld: there is a one-to-one correspondence between connected, simply-connected Poisson Lie 2-groups and Lie 2-bialgebras. In fact, we also prove that there is a one-to-one…

Differential Geometry · Mathematics 2021-06-07 Zhuo Chen , Mathieu Stienon , Ping Xu

Farkas and Ortega found counterexamples to Mercat's conjecture by restricting to a hyperplane section $C$ some suitable rank-two vector bundles on a $K3$ surface whose Picard group is generated by $C$ and another very ample divisor. We…

Algebraic Geometry · Mathematics 2024-01-17 Marian Aprodu , Laura Filimon

We reconsider a classical theorem by Bican and El Bashir, which guarantees the existence of non-trivial relatively pure submodules in a module category over a ring with unit. Our aim is to generalize the theorem to module categories over…

Category Theory · Mathematics 2013-10-31 Alexander Schmeding

We prove two existing conjectures which describe the geometrical McKay correspondence for a finite abelian G in SL3(C) such that C^3/G has a single isolated singularity. We do it by studying the relation between the derived category…

Algebraic Geometry · Mathematics 2012-05-16 Timothy Logvinenko

Recently, motivated by supersymmetric gauge theory, Cachazo, Douglas, Seiberg, and Witten proposed a conjecture about finite dimensional simple Lie algebras, and checked it in the classical cases. We prove the conjecture for type G_2, and…

Quantum Algebra · Mathematics 2007-05-23 Pavel Etingof , Victor Kac

Let $K$ be a complete non-Archimedean field $K$ with separated power series, treated in the analytic Denef--Pas language. We prove the existence of definable retractions onto an arbitrary closed definable subset of $K^{n}$, whereby…

Algebraic Geometry · Mathematics 2019-04-02 Krzysztof Jan Nowak

In 1985, van den Dries showed that the theory of the reals with a predicate for the integer powers of two admits quantifier elimination in an expanded language, and is hence decidable. He gave a model-theoretic argument, which provides no…

Logic in Computer Science · Computer Science 2007-05-23 Jeremy Avigad , Yimu Yin