English
Related papers

Related papers: Deligne--Illusie Classes as Arithmetic Kodaira--Sp…

200 papers

We provide a short proof of the necessity of Crawley-Boevey's condition in his solution to the Deligne-Simpson problem. The proof relies on the local neighbourhood theorem for $2$-Calabi-Yau categories due to Davison together with…

Algebraic Geometry · Mathematics 2026-04-14 Lucien Hennecart

We construct examples of number fields which are not isomorphic but for which their idele class groups are isomorphic. We also construct examples of projective algebraic curves which are not isomorphic but for which their Jacobian varieties…

Number Theory · Mathematics 2014-09-11 Dipendra Prasad

The Deligne-Lusztig varieties associated to the Coxeter classes of the algebraic groups 2A2, 2B2 and 2G2 are affine algebraic curves. We produce explicit projective models of the closures of these curves. Furthermore for $d$ the Coxeter…

Number Theory · Mathematics 2011-01-04 Daniel M. Kane

Different generators of a deformed oscillator algebra give rise to one-parameter families of $q$-exponential functions and $q$-Hermite polynomials related by generating functions. Connections of the Stieltjes and Hamburger classical moment…

q-alg · Mathematics 2009-10-30 E. V. Damaskinsky , P. P. Kulish

In this paper we define the formal and tempered Deligne cohomology groups, that are obtained by applying the Deligne complex functor to the complexes of formal differential forms and tempered currents respectively. We then prove the…

Algebraic Geometry · Mathematics 2010-11-17 J. I. Burgos Gil

We generalize the logarithmic decomposition theorem of Deligne-Illusie to a filtered version. There are two applications. The easier one provides a mod $p$ proof for a vanishing theorem in characteristic zero. The deeper one gives rise to a…

Algebraic Geometry · Mathematics 2021-09-07 Zebao Zhang

We solve the isoclinic Deligne--Simpson problem for exceptional groups, completing a program initiated by Sage et al. and Jakob--Yun. As a by-product, we obtain new examples of physically rigid irregular connections on the projective line.…

Algebraic Geometry · Mathematics 2026-03-24 Masoud Kamgarpour , Bailey Whitbread

We consider the problem of smoothing algebraic cycles with rational coefficients on smooth projective complex varieties up to homological equivalence. We show that a solution to this problem would be incompatible with the validity of the…

Algebraic Geometry · Mathematics 2024-10-22 Olivier Benoist , Claire Voisin

We show that given a rigid C*-tensor category, there is an equivalence of categories between normalized irreducible Q-systems, also known as connected unitary Frobenius algebra objects, and compact connected W*-algebra objects. Although…

Operator Algebras · Mathematics 2017-07-10 Corey Jones , David Penneys

To any fixed, finite relational structure, $\mathbb{D}$, there is an associated decision problem, CSP$(\mathbb{D})$, which is a restricted version of the constraint satisfaction problem. In [8], the so called "algebraic approach" to the…

Logic · Mathematics 2016-09-14 Ian Payne

We prove an analogue for Stokes torsors of Deligne's skeleton conjecture and deduce from it the representability of the functor of relative Stokes torsors by an affine scheme of finite type over C. This provides, in characteristic 0, a…

Algebraic Geometry · Mathematics 2017-01-12 Jean-Baptiste Teyssier

We consider a slightly modified form of the standard Rudin-Keisler order on ideals and demonstrate the existence of complete (with respect to this order) ideals in various projective classes. Using our methods, we obtain a simple proof of…

Logic · Mathematics 2014-06-20 Konstantinos A. Beros

The complexity class $\exists\mathbb R$, standing for the complexity of deciding the existential first order theory of the reals as real closed field in the Turing model, has raised considerable interest in recent years. It is well known…

Computational Complexity · Computer Science 2025-02-04 Klaus Meer , Adrian Wurm

Substructural type systems, such as affine (and linear) type systems, are type systems which impose restrictions on copying (and discarding) of variables, and they have found many applications in computer science, including quantum…

Logic in Computer Science · Computer Science 2021-01-27 Vladimir Zamdzhiev

Gopal Prasad and A. S. Rapinchuk defined a notion of weakly commensurable lattices in a semisimple group, and gave a classification of weakly commensurable Zariski dense subgroups. A motivation was to classify pairs of locally symmetric…

Number Theory · Mathematics 2012-12-07 Chandrasheel Bhagwat , Supriya Pisolkar , C. S. Rajan

We consider polynomial maps, which we call degree $d$-linear maps, that satisfy the Jacobian condition. We prove that certain infinite families of elements, which appear in the coefficients of the formal inverse of such maps, are in the…

Commutative Algebra · Mathematics 2021-11-09 Mario DeFranco

We show that in the Deligne categories $\mathrm{Rep}(S_t)$ for $t$ a transcendental number, the only simple algebra objects are images of simple algebras in the category of representations of a symmetric group under a canonical induction…

Representation Theory · Mathematics 2016-01-01 Luke Sciarappa

We study the properties of rings satisfying Auslander-type conditions. If an artin algebra $\Lambda$ satisfies the Auslander condition (that is, $\Lambda$ is an $\infty$-Gorenstein artin algebra), then we construct two kinds of…

Rings and Algebras · Mathematics 2010-11-01 Zhaoyong Huang , Osamu Iyama

A class of Riemann-Cartan G\"odel-type space-times is examined by using the equivalence problem techniques, as formulated by Fonseca-Neto et al. and embodied in a suite of computer algebra programs called TCLASSI. A coordinate-invariant…

General Relativity and Quantum Cosmology · Physics 2015-06-25 J. B. Fonseca-Neto , M. J. Reboucas

Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete…

Computational Complexity · Computer Science 2013-09-06 Christian Herrmann , Johanna Sokoli , Martin Ziegler