English
Related papers

Related papers: Uniqueness typing for intersection types

200 papers

Refinement types sharpen systems of simple and dependent types by offering expressive means to more precisely classify well-typed terms. We present a system of refinement types for LF in the style of recent formulations where only canonical…

Programming Languages · Computer Science 2015-07-01 William Lovas , Frank Pfenning

We describe the topological behavior of the conjugacy action of the mapping class group of an orientable infinite-type surface $\Sigma$ on itself. Our main results are: (1) All conjugacy classes of $MCG(\Sigma)$ are meager for every…

This paper introduces a new family of models of intensional Martin-L\"of type theory. We use constructive ordered algebra in toposes. Identity types in the models are given by a notion of Moore path. By considering a particular gros topos,…

Logic in Computer Science · Computer Science 2023-06-22 Ian Orton , Andrew M. Pitts

We consider several classes of complete intersection numerical semigroups, aris- ing from many different contexts like algebraic geometry, commutative algebra, coding theory and factorization theory. In particular, we determine all the…

Commutative Algebra · Mathematics 2014-04-08 Marco D'Anna , Vincenzo Micale , Alessio Sammartano

Bidirectional typing is a discipline in which the typing judgment is decomposed explicitly into inference and checking modes, allowing to control the flow of type information in typing rules and to specify algorithmically how they should be…

Logic in Computer Science · Computer Science 2024-04-22 Thiago Felicissimo

A word $w$ of letters on edges of underlying graph $\Gamma$ of deterministic finite automaton (DFA) is called synchronizing if $w$ sends all states of the automaton to a unique state. J. \v{C}erny discovered in 1964 a sequence of $n$-state…

Formal Languages and Automata Theory · Computer Science 2019-11-12 A. N. Trahtman

We hope to see how much for a model M of some completion T of PA (Peano Arithmetic) does M restriction {<} determine M, say up to isomorphism. We advance in characterizing for non-standard models M of PA the "minimal" set {(a,b):n < a < b…

Logic · Mathematics 2012-06-12 Saharon Shelah

The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while…

Logic in Computer Science · Computer Science 2012-03-29 Pablo Buiras , Alejandro Díaz-Caro , Mauro Jaskelioff

System I is a simply-typed lambda calculus with pairs, extended with an equational theory obtained from considering the type isomorphisms as equalities. In this work we propose an extension of System I to polymorphic types, adding the…

Logic in Computer Science · Computer Science 2021-07-28 Cristian F. Sottile , Alejandro Díaz-Caro , Pablo E. Martínez López

This paper concerns the non-commutative analog of the Normal Subgroup Theorem for certain groups. Inspired by Kalantar-Panagopoulos, we show that all $\Gamma$-invariant subalgebras of $L\Gamma$ and $C^*_r(\Gamma)$ are ($\Gamma$-)…

Operator Algebras · Mathematics 2023-10-17 Tattwamasi Amrutam , Yair Hartman

We consider a possibility of the existence of intersection homology morphism, which would be associated to a map of analytic varieties. We assume that the map is an inclusion of codimension one. Then the existence of a morphism follows from…

Algebraic Geometry · Mathematics 2007-05-23 Andrzej Weber

By the Road Coloring Theorem (Trahtman, 2008), the edges of any aperiodic directed multigraph with a constant out-degree can be colored such that the resulting automaton admits a reset word. There may also be a need for a particular reset…

Formal Languages and Automata Theory · Computer Science 2014-12-03 Vojtěch Vorel , Adam Roman

We construct new monomorphisms between mapping class groups of surfaces. The first family of examples injects the mapping class group of a closed surface into that of a different closed surface. The second family of examples are defined on…

Geometric Topology · Mathematics 2014-11-11 Javier Aramayona , Christopher J. Leininger , Juan Souto

Let $\Gamma$ be the fundamental group of a closed orientable surface of genus at least two. Consider the composition of a uniformly random element of $\mathrm{Hom}(\Gamma,S_n)$ with the $(n-1)$-dimensional irreducible representation of…

Geometric Topology · Mathematics 2025-04-30 Michael Magee , Doron Puder , Ramon van Handel

We define the covering gonality and separable covering gonality of varieties over arbitrary fields, generalizing the definition given by Bastianelli-de Poi-Ein-Lazarsfeld-Ullery for complex varieties. We show that over an arbitrary field a…

Algebraic Geometry · Mathematics 2022-07-13 Geoffrey Smith

We study distinct $(0,1)$ matrices $A$ and $B$, called \textit{Gram mates}, such that $AA^T=BB^T$ and $A^TA=B^TB$. We characterize Gram mates where one can be obtained from the other by changing signs of some positive singular values. We…

Combinatorics · Mathematics 2023-04-18 Sooyeong Kim , Steve Kirkland

A polynomial automorphism of $\mathbb{A}^n$ over a field of characteristic zero is called co-tame if, together with the affine subgroup, it generates the entire tame subgroup. We prove some new classes of automorphisms, including…

Algebraic Geometry · Mathematics 2017-05-04 Eric Edo , Drew Lewis

Type A N-fold supercharge admits a one-parameter family of factorizations into product of N first-order linear differential operators due to an underlying GL(2,C) symmetry. As a consequence, a type A N-fold supersymmetric system can have…

High Energy Physics - Theory · Physics 2009-10-06 Bijan Bagchi , Toshiaki Tanaka

Let $\Gamma$ be a finite graph and let $A(\Gamma)$ be the corresponding right-angled Artin group. We characterize the Hamiltonicity of $\Gamma$ via the structure of the cohomology algebra of $A(\Gamma)$. In doing so, we define and develop a…

Group Theory · Mathematics 2021-08-25 Ramón Flores , Delaram Kahrobaei , Thomas Koberda

$\Gamma$-convergence methods are used to prove homogenization results for fractional obstacle problems in periodically perforated domains. The obstacles have random sizes and shapes and their capacity scales according to a stationary…

Classical Analysis and ODEs · Mathematics 2009-02-17 M. Focardi