English
Related papers

Related papers: On the Dixmier problem (Seminar report after Monod…

200 papers

The paper presents an elaborated and simplified version of the structural result for branching bisimilarity on normed BPA (Basic Process Algebra) processes that was the crux of a conference paper by Czerwinski and Jancar (arxiv 7/2014 and…

Logic in Computer Science · Computer Science 2019-03-14 Petr Jancar

J. Dixmier asked in 1950 whether every non-amenable group admits uniformly bounded representations that cannot be unitarised. We provide such representations upon passing to extensions by abelian groups. This gives a new characterisation of…

Group Theory · Mathematics 2010-01-17 Nicolas Monod , Narutaka Ozawa

Manna and Waldinger's theory of substitutions and unification has been verified using the Cambridge LCF theorem prover. A proof of the monotonicity of substitution is presented in detail, as an example of interaction with LCF. Translating…

Logic in Computer Science · Computer Science 2008-02-03 Lawrence C. Paulson

A two-part report, containing (unrelated) essays on subobject classifiers and on monads.

Category Theory · Mathematics 2019-01-25 Arnold Tan Junhan

We give new, short proofs of the presentations for the partition monoid and its singular ideal originally given in the author's 2011 papers in J Alg and IJAC.

Group Theory · Mathematics 2016-06-28 James East

I now agree with conclusion of author that there is a problem with unitarity in discussed models.

High Energy Physics - Theory · Physics 2008-02-03 Paul Federbush

This paper intends to give a mathematical explanation for results on the zeta-function of some families of varieties recently obtained in the context of Mirror Symmetry. In doing so, we obtain concrete and explicit examples for some results…

Number Theory · Mathematics 2008-08-01 Remke Kloosterman

This paper is the concise addition to the foregoing work "Inconsistency of Inaccessibility", containing the presentation of main theorem proof (in ZF) about inaccessible cardinals nonexistence. Here some refinement of this presentation is…

Logic · Mathematics 2011-10-21 A. Kiselev

A monoid is called special if it admits a presentation in which all defining relations are of the form $w = 1$. Every group is special, but not every monoid is special. In this article, we describe the language-theoretic properties of the…

Group Theory · Mathematics 2021-11-23 Carl-Fredrik Nyberg-Brodda

The work presents the brief exposition of the proof (in ZF) of inaccessible cardinals nonexistence. To this end in view there is used the apparatus of subinaccessible cardinals and its basic tools -- reduced formula spectra and matrices and…

Logic · Mathematics 2011-10-18 A. Kiselev

This is the text of a series of three lectures given at the CMA of the Australian National University on the recent solution of the square root problem for divergence form elliptic operators, a long-standing conjecture posed by Kato in the…

Classical Analysis and ODEs · Mathematics 2007-05-23 P. Auscher

There is a recent interest for the verification of monadic programs using proof assistants. This line of research raises the question of the integration of monad transformers, a standard technique to combine monads. In this paper, we extend…

Logic in Computer Science · Computer Science 2021-07-20 Reynald Affeldt , David Nowak

We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David…

Logic in Computer Science · Computer Science 2021-04-27 Guillaume Dubach , Fabian Muehlboeck

Recently, D. Burns and C. Greither (Invent. Math., 2003) deduced an equivariant version of the main conjecture for abelian number fields. This was the key to their proof of the equivariant Tamagawa number conjecture. A. Huber and G. Kings…

Number Theory · Mathematics 2012-05-24 Malte Witte

In this paper we prove the Dichotomy Conjecture on the complexity of nonuniform constraint satisfaction problems posed by Feder and Vardi.

Computational Complexity · Computer Science 2017-04-07 Andrei A. Bulatov

The paper covers known facts about the Dixmier trace (with some generalities about traces), the Wodzicki residue, and Connes' trace theorem, including two variants of proof of the latter. Action formulas are treated very sketchy, because…

Mathematical Physics · Physics 2007-05-23 P. M. Alberti , R. Matthes

We prove that a monoid is sofic, in the sense recently introduced by Ceccherini-Silberstein and Coornaert, whenever the J-class of the identity is a sofic group, and the quotients of this group by orbit stabilisers in the rest of the monoid…

Group Theory · Mathematics 2014-01-29 Mark Kambites

This paper is devoted to several existence results for a generalized version of the Yamabe problem. First, we prove the remaining global cases for the range of powers $\gamma\in (0,1)$ for the generalized Yamabe problem introduced by…

Analysis of PDEs · Mathematics 2019-11-11 Cheikh Birahim Ndiaye , Yannick Sire , Liming Sun

In this paper, we prove a fine condensation theorem. This is quite similar to condensation theorems for pure extender mice in the literature, except that condensation for iteration strategies has been added to the mix.

Logic · Mathematics 2023-08-25 John Steel , Nam Trang

The work presents the first part of second edition of the previous edition of 2000 under the same title containing the proof (in ZF) of the nonexistence of inaccessible cardinals, now enriched and improved. This part contains the apparatus…

Logic · Mathematics 2011-10-13 A. Kiselev
‹ Prev 1 2 3 10 Next ›