English
Related papers

Related papers: On the equivalence of types

200 papers

We define, for any group $G$, finite approximations ; with this tool, we give a new presentation of the profinite completion $\hat{\pi} : G \to \hat{G}$ of an abtract group $G$. We then prove the following theorem : if $k$ is a finite prime…

Group Theory · Mathematics 2008-01-21 Colas Bardavid

In this paper we introduce and investigate a one-parameter family of polynomials. They are semisymmetric, i.e. symmetric in the variables with odd and even index separately. In fact, the family forms a basis of the space of semisymmetric…

Representation Theory · Mathematics 2022-10-17 Friedrich Knop

We generalize a version of Lavrent\'ev's theorem which says that a function that is continuous on a compact set K with connected complement and without interior points can be uniformly approximated as closely as desired by a polynomial…

Complex Variables · Mathematics 2019-07-02 Johan Andersson , Linnea Rousu

Let A be a finitely generated connected graded k-algebra defined by a finite number of monomial relations. Then there is a finite directed graph, Q, the Ufnarovskii graph of A, for which the categories QGr(A) and QGr(kQ) are equivalent:…

Rings and Algebras · Mathematics 2011-10-14 Cody Holdaway , S. Paul Smith

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

Symbolic Computation · Computer Science 2025-02-10 Nicolas Faroß , Thomas Sturm

A type system is introduced for a generic Object Oriented programming language in order to infer resource upper bounds. A sound andcomplete characterization of the set of polynomial time computable functions is obtained. As a consequence,…

Programming Languages · Computer Science 2018-02-20 Emmanuel Hainry , Romain Péchoux

For any two complete discrete valued fields $K_1$ and $K_2$ of mixed characteristic with perfect residue fields, we show that if the $n$-th valued hyperfields of $K_1$ and $K_2$ are isomorphic over $p$ for each $n\ge1$, then $K_1$ and $K_2$…

Commutative Algebra · Mathematics 2018-09-10 Junguk Lee

We obtain several results concerning the concept of isotypic structures. Namely we prove that any field of finite transcendence degree over a prime subfield is defined by types; then we construct isotypic but not isomorphic structures with…

Logic · Mathematics 2025-06-18 Pavel Gvozdevsky

We show that the integrable subclassess of a class of third order non-autonomous equations are identical with the integrable subclassess of the autonomous ones.

solv-int · Physics 2009-10-28 Metin Gurses , Atalay Karasu

This paper deals with properties of the algebraic variety defined as the set of zeros of a "deficient" sequence of multivariate polynomials. We consider two types of varieties: ideal-theoretic complete intersections and absolutely…

Algebraic Geometry · Mathematics 2022-08-19 Nardo Giménez , Guillermo Matera , Mariana Pérez , Melina Privitelli

We define a computational type theory combining the contentful equality structure of cartesian cubical type theory with internal parametricity primitives. The combined theory supports both univalence and its relational equivalent, which we…

Logic in Computer Science · Computer Science 2023-06-22 Evan Cavallo , Robert Harper

Two matrices are said to be principal minor equivalent if they have equal corresponding principal minors of all orders. We give a characterization of principal minor equivalence and a deterministic polynomial time algorithm to check if two…

Computational Complexity · Computer Science 2024-10-04 Abhranil Chatterjee , Sumanta Ghosh , Rohit Gurjar , Roshan Raj

Cubical type theory is an extension of Martin-L\"of type theory recently proposed by Cohen, Coquand, M\"ortberg and the author which allows for direct manipulation of $n$-dimensional cubes and where Voevodsky's Univalence Axiom is provable.…

Logic in Computer Science · Computer Science 2017-10-31 Simon Huber

Tensor polynomial identities generalize the concept of polynomial identities on $d \times d$ matrices to identities on tensor product spaces. Here we completely characterize a certain class of tensor polynomial identities in terms of their…

Rings and Algebras · Mathematics 2022-09-13 Felix Huber , Claudio Procesi

We develop category theory within Univalent Foundations, which is a foundational system for mathematics based on a homotopical interpretation of dependent type theory. In this system, we propose a definition of "category" for which equality…

Category Theory · Mathematics 2019-02-20 Benedikt Ahrens , Chris Kapulkin , Michael Shulman

Let $X$ and $Y$ be smooth projective varieties over $\mathbb{C}$. They are called {\it $D$-equivalent} if their derived categories of bounded complexes of coherent sheaves are equivalent as triangulated categories, while {\it…

Algebraic Geometry · Mathematics 2007-05-23 Yujiro Kawamata

Let $\mathbb{F}$ be a field of characteristic different from $2$ and $3$, and let $V$ be a vector space of dimension $2$ over $\mathbb{F}$. The generic classification of homogeneous quadratic maps $f\colon V\to V$ under the action of the…

Representation Theory · Mathematics 2022-09-27 R. Durán Díaz , L. Hernández Encinas , J. Muñoz Masqué

We give new definitions for the determinant over commutative ring $K$, noncommutative ring $\mathbf{K}$, noncommutative ring $\mathcal{K}$ with associative powers, over noncommutative nonassociative ring $\mathfrak{K}$, and study their…

Combinatorics · Mathematics 2012-01-04 Georgy Egorychev

Let K be a field. For a given valuation on K[x], we determine the structure of its graded algebra and describe its set of key polynomials, in terms of any given key polynomial of minimal degree. We also characterize valuations not admitting…

Algebraic Geometry · Mathematics 2018-03-23 Enric Nart

By extending type theory with a universe of definitionally associative and unital polynomial monads, we show how to arrive at a definition of opetopic type which is able to encode a number of fully coherent algebraic structures. In…

Logic in Computer Science · Computer Science 2021-05-04 Antoine Allioux , Eric Finster , Matthieu Sozeau