English
Related papers

Related papers: A Univalent Formalization of Constructive Affine S…

200 papers

We present a uniform theory of constructible sheaves on arbitrary schemes with coefficients in topological or even condensed rings. This is accomplished by defining lisse sheaves to be the dualizable objects in the derived infinity-category…

Algebraic Geometry · Mathematics 2023-05-30 Tamir Hemo , Timo Richarz , Jakob Scholbach

In this paper, we study the structures of Schur algebra and Lusztig algebra associated to partial flag varieties of affine type D. We show that there is a subalgebra of Lusztig algebra and the quantum groups arising from this subalgebras…

Quantum Algebra · Mathematics 2024-03-08 Quanyong Chen , Zhaobing Fan

We prove constructively the existence of surjective morphisms from affine space onto certain open subvarieties of affine space of the same dimension. For any algebraic set $Z\subset \mathbb{A}^{n-2}\subset \mathbb{A}^{n}$, we construct an…

Algebraic Geometry · Mathematics 2023-08-22 Viktor Balch Barth

In this sequel of arXiv:1211.5294 and arXiv:1211.5948, we develop an adic formalism for \'etale cohomology of Artin stacks and prove several desired properties including the base change theorem. In addition, we define perverse t-structures…

Algebraic Geometry · Mathematics 2017-09-27 Yifeng Liu , Weizhe Zheng

For any flat family of pure-dimensional coherent sheaves on a family of projective schemes, the Harder-Narasimhan type (in the sense of Gieseker semistability) of its restriction to each fiber is known to vary semicontinuously on the…

Algebraic Geometry · Mathematics 2009-11-12 Nitin Nitsure

Affine automata provide a finite-state computational model that preserves the linear-algebraic structure of quantum computation while operating entirely over the reals. Recent work has shown that affine automata can far surpass classical…

Formal Languages and Automata Theory · Computer Science 2026-05-04 Zeyu Chen , Junde Wu

In this paper all of the classical constructions of A. Young are generalized to affine Hecke algebras of type A. It is proved that the calibrated irreducible representations of the affine Hecke algebra are indexed by placed skew shapes and…

Representation Theory · Mathematics 2007-05-23 Arun Ram

We introduce an Uhlenbeck closure of the space of based maps from projective line to the Kashiwara flag scheme of an untwisted affine Lie algebra. For the algebra $\hat{sl}_n$ this space of based maps is isomorphic to the moduli space of…

Algebraic Geometry · Mathematics 2007-05-23 Michael Finkelberg , Dennis Gaitsgory , Alexander Kuznetsov

Formal Methods are mathematically-based techniques for software design and engineering, which enable the unambiguous description of and reasoning about a system's behaviour. Autonomous systems use software to make decisions without human…

Software Engineering · Computer Science 2021-07-29 Matt Luckcuck

The theory of associative $n$-categories has recently been proposed as a strictly associative and unital approach to higher category theory. As a foundation for a proof assistant, this is potentially attractive, since it has the potential…

Logic in Computer Science · Computer Science 2022-05-19 Lukas Heidemann , David Reutter , Jamie Vicary

We construct families of smooth affine surfaces with pairwise non isomorphic A 1-cylinders but whose A 2-cylinders are all isomorphic. These arise as complements of cuspidal hyperplane sections of smooth projective cubic surfaces.

Algebraic Geometry · Mathematics 2015-07-22 Adrien Dubouloz

We explain how to obtain new classical integrable field theories by assembling two affine Gaudin models into a single one. We show that the resulting affine Gaudin model depends on a parameter $\gamma$ in such a way that the limit $\gamma…

High Energy Physics - Theory · Physics 2019-06-13 Francois Delduc , Sylvain Lacroix , Marc Magro , Benoit Vicedo

The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) we developed to formalize the foundations of universal algebra in dependent type theory using the Agda programming language and proof…

Logic in Computer Science · Computer Science 2021-04-21 William DeMeo

We classify affine operators on a unitary or Euclidean space U up to topological conjugacy. An affine operator is a map f: U-->U of the form f(x)=Ax+b, in which A: U-->U is a linear operator and b in U. Two affine operators f and g are said…

General Topology · Mathematics 2010-10-19 Tetiana Budnitska

This paper introduces calibrated representations for affine Hecke algebras and classifies and constructs all finite dimensional irreducible calibrated representations. The primary technique is to provide indexing sets for controlling the…

Representation Theory · Mathematics 2007-05-23 Arun Ram

Following a project of developing conventions and notations for informal type theory carried out in the homotopy type theory book for a framework built out of an augmentation of constructive type theory with axioms governing…

Logic in Computer Science · Computer Science 2018-06-25 Bruno Bentzen

Following Serre's initial work, a number of authors have considered twists of quadratic forms on a scheme Y by torsors of a finite group G, together with formulas for the Hasse-Witt invariants of the twisted form. In this paper we take the…

Algebraic Geometry · Mathematics 2011-11-08 Philippe Cassou-Noguès , Ted Chinburg , Baptiste Morin , Martin Taylor

We study Novikov algebras and Novikov structures on finite-dimensional Lie algebras. We show that a Lie algebra admitting a Novikov structure must be solvable. Conversely we present an example of a nilpotent 2-step solvable Lie algebra…

Mathematical Physics · Physics 2009-11-11 Dietrich Burde , Karel Dekimpe

We exhibit an algorithm to compute the strongest polynomial (or algebraic) invariants that hold at each location of a given affine program (i.e., a program having only non-deterministic (as opposed to conditional) branching and all of whose…

Logic in Computer Science · Computer Science 2018-05-03 Ehud Hrushovski , Joël Ouaknine , Amaury Pouly , James Worrell

This paper describes an abstract machine for linguistic formalisms that are based on typed feature structures, such as HPSG. The core design of the abstract machine is given in detail, including the compilation process from a high-level…

cmp-lg · Computer Science 2008-02-03 Shuly Wintner , Nissim Francez
‹ Prev 1 4 5 6 7 8 10 Next ›