English
Related papers

Related papers: Large and Infinitary Quotient Inductive-Inductive …

200 papers

We construct new compactifications with good properties of moduli spaces of maps from nonsingular marked curves to a large class of GIT quotients. This generalizes from a unified perspective many particular examples considered earlier in…

Algebraic Geometry · Mathematics 2011-07-22 Ionut Ciocan-Fontanine , Bumsig Kim , Davesh Maulik

Let $d \ge 1$. We study a subspace of the space of automorphic forms of $\mathrm{GL}_d$ over a global field of positive characteristic (or, a function field of a curve over a finite field). We fix a place $\infty$ of $F$, and we consider…

Number Theory · Mathematics 2021-01-08 Satoshi Kondo , Seidai Yasuda

Quotients and comprehension are fundamental mathematical constructions that can be described via adjunctions in categorical logic. This paper reveals that quotients and comprehension are related to measurement, not only in quantum logic,…

Logic in Computer Science · Computer Science 2015-11-06 Kenta Cho , Bart Jacobs , Bas Westerbaan , Bram Westerbaan

Let Q be a non-singular quadratic form with integer coefficients. When Q is indefinite we provide new upper bounds for the least non-trivial integral solution to the equation Q=0. When Q is positive definite we provide improved upper bounds…

Number Theory · Mathematics 2014-02-26 T. D. Browning , R. Dietmann

Reynold's abstraction theorem is now a well-established result for a large class of type systems. We propose here a definition of relational parametricity and a proof of the abstraction theorem in the Calculus of Inductive Constructions…

Logic in Computer Science · Computer Science 2012-09-28 Chantal Keller , Marc Lasson

Instruction subsets are heuristics that can reduce the size of the inductive programming search space by tens of orders of magnitude. Comprising many overlapping subsets of different sizes, they serve as predictions of the instructions…

Artificial Intelligence · Computer Science 2024-07-02 Edward McDaid , Sarah McDaid

The paper describes the refinement algorithm for the Calculus of (Co)Inductive Constructions (CIC) implemented in the interactive theorem prover Matita. The refinement algorithm is in charge of giving a meaning to the terms, types and proof…

Logic in Computer Science · Computer Science 2015-07-01 Andrea Asperti , Wilmer Ricciotti , Claudio Sacerdoti Coen , Enrico Tassi

In this paper we examine how the notion of algebra of quotients for Lie algebras ties up with the corresponding well-known concept in the associative case. Specifically, we completely characterize when a Lie algebra $Q$ is an algebra of…

Rings and Algebras · Mathematics 2007-05-23 Francesc Perera , Mercedes Siles Molina

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

Although there is no natural internal product for hermitian forms over an algebra with involution of the first kind, we describe how to multiply two $\varepsilon$-hermitian forms to obtain a quadratic form over the base field. This allows…

Rings and Algebras · Mathematics 2023-04-04 Nicolas Garrel

The paper uses the formalism of indexed categories to recover the proof of a standard final coalgebra theorem, thus showing existence of final coalgebras for a special class of functors on categories with finite limits and colimits. As an…

Logic · Mathematics 2007-05-23 Benno van den Berg , Federico De Marchi

We present the model theoretic concepts that allow mathematics to be developed with the notion of the potential infinite instead of the actual infinite. The potential infinite is understood as a dynamic notion, being an indefinitely…

Logic · Mathematics 2022-12-16 Matthias Eberl

We explore the possibility of extending Mardare et al. quantitative algebras to the structures which naturally emerge from Combinatory Logic and the lambda-calculus. First of all, we show that the framework is indeed applicable to those…

Logic in Computer Science · Computer Science 2022-04-29 Ugo Dal Lago , Furio Honsell , Marina Lenisa , Paolo Pistone

This investigation pertains to the construction of a class of generalised deformed derivative operators which furnish the familiar finite difference and the q-derivatives as special cases. The procedure involves the introduction of a linear…

Quantum Algebra · Mathematics 2009-11-10 Dayanand Parashar , Deepak Parashar

Two finitely generated groups have the same set of finite quotients if and only if their profinite completions are isomorphic. Consider the map which sends (the isomorphism class of) an S-arithmetic group to (the isomorphism class of) its…

Group Theory · Mathematics 2011-10-25 Menny Aka

The purpose of this this paper is to generalize the functors arising from the theory of Witt vectors duto to Cartier. Given a polynomial $g(q)\in \mathbb Z[q]$, we construct a functor ${\overline {W}}^{g(q)}$ from the category of $\mathbb…

Rings and Algebras · Mathematics 2015-03-26 Young-Tak Oh

We study quadratic form parameters $Q$ over the integers and extended quadratic forms with values in $Q$, which we call $Q$-forms. Certain form parameters $Q$ appeared in Wall's work on the classification of almost closed $(n-1)$-connected…

Geometric Topology · Mathematics 2026-05-26 Diarmuid Crowley , Csaba Nagy

We introduce the quantum isomeric supercategory and the quantum affine isomeric supercategory. These diagrammatically defined supercategories, which can be viewed as isomeric analogues of the HOMFLYPT skein category and its affinization,…

Quantum Algebra · Mathematics 2024-05-15 Alistair Savage

We present an extensive mechanization of the meta-theory of Martin-L\"of Type Theory (MLTT) in the Coq proof assistant. Our development builds on pre-existing work in Agda to show not only the decidability of conversion, but also the…

Programming Languages · Computer Science 2023-10-11 Arthur Adjedj , Meven Lennon-Bertrand , Kenji Maillard , Pierre-Marie Pédrot , Loïc Pujet

Using sequences of finite length with positive integer elements and the inversion statistic on such sequences, a collection of binomial and multinomial identities are extended to their $q$-analog form via combinatorial proofs. Using the…

Combinatorics · Mathematics 2020-05-18 Adrian Avalos , Mark Bly
‹ Prev 1 8 9 10 Next ›