English
Related papers

Related papers: Binary intersection formalized

200 papers

Let $f:X-->Y$ be a map of algebraic varieties. Barthel, Brasselet, Fieseler, Gabber and Kaup have shown that there exists a homomorphism of intersection homology groups $f^*:IH^*(Y)-->IH^*(X)$ compatible with the induced homomorphism on…

alg-geom · Mathematics 2007-05-23 Andrzej Weber

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Venneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…

Logic in Computer Science · Computer Science 2023-06-22 Andrew Polonsky , Richard Statman

We develop a tropical intersection formalism of forms and currents that extends classical tropical intersection theory in two ways. First, it allows to work with arbitrary polytopes, also non-rational ones. Second, it allows for smooth…

Algebraic Geometry · Mathematics 2022-08-30 Andreas Mihatsch

We generalize a construction of Barthel-Brasselet-Fieseler-Gabber-Kaup in the setting of complex varieties to the setting of finite type, complex algebraic stacks. Given two such stacks $\mathcal{X},\mathcal{Y}$ with affine stabilizers, and…

Algebraic Geometry · Mathematics 2025-04-08 Matthew Huynh

Fixed points ${\bf u}=\varphi({\bf u})$ of marked and primitive morphisms $\varphi$ over arbitrary alphabet are considered. We show that if ${\bf u}$ is palindromic, i.e., its language contains infinitely many palindromes, then some power…

Combinatorics · Mathematics 2015-09-14 Sébastien Labbé , Edita Pelantová

We study the refinement invariance of several intersection (co)homologies existing in the literature. These (co)homologies have been introduced in order to establish the Poincar\'e Duality in variousl contexts. We found the classical…

Algebraic Topology · Mathematics 2023-06-09 Martin Saralegi-Aranguren

We study derived intersections of smooth analytic cycles, and provide in some cases necessary and sufficient conditions for this intersection be formal. In particular, if X is a complex submanifold of a complex manifold Y, we prove that X…

Algebraic Geometry · Mathematics 2017-10-10 Julien Grivaux

This paper classifies binary morphisms that map to ultimately periodic words. In particular, if a morphism h maps an infinite non-ultimately periodic word to an ultimately periodic word then it must be true that h(0) commutes with h(1).

Discrete Mathematics · Computer Science 2008-05-12 Brendan Lucier

We find an explicit closed form for the subword complexity of the infinite fixed point of the morphism sending $a \rightarrow aab$ and $b \rightarrow b$. This morphism is then generalized in three different ways, and we find similar…

Combinatorics · Mathematics 2016-05-10 J. -P. Allouche , J. Shallit

Language interference is common in today's multilingual societies where more languages are being in contact and as a global final result leads to the creation of hybrid languages. These, together with doubts on their right to be officially…

Computation and Language · Computer Science 2019-12-19 Nataliya Sira , Giorgio Maria Di Nunzio , Viviana Nosilia

This paper investigates type isomorphism in a lambda-calculus with intersection and union types. It is known that in lambda-calculus, the isomorphism between two types is realised by a pair of terms inverse one each other. Notably,…

Logic in Computer Science · Computer Science 2015-08-12 Mario Coppo , Mariangiola Dezani-Ciancaglini , Ines Margaria , Maddalena Zacchi

The state complexity of the result of a regular operation is often positively correlated with the number of distinct transformations induced by letters in the minimal deterministic finite automaton of the input languages. That is, more…

Formal Languages and Automata Theory · Computer Science 2018-09-07 Sylvie Davies

An alternative proof of the duality of generalized Lie bialgebroid is given and proved a canonical Jacobi structure can be defined on the base of it. We also introduce the notion of morphism between generalized Lie bialgebroids and proved…

Mathematical Physics · Physics 2015-09-01 Apurba Das

We translate the results of Yansong Xu into the language of~\cite{GGV1}, obtaining nearly the same formulas for the intersection number of Jacobian pairs, but with an inequality instead of an equality.

Algebraic Geometry · Mathematics 2018-08-16 Jorge Alberto Guccione , Juan José Guccione , Rodrigo Horruitiner , Christian Valqui

We investigate Tukey morphisms between binary relations, establishing several fundamental lemmas. We then specialize to finite binary relations, using computational methods to classify all binary relations with at most $6$ points in the…

Combinatorics · Mathematics 2026-02-02 Rhett Barton , Samuel Coskey , Paul Ellis

Using a cap product, we construct an explicit Poincar\'e duality isomorphism between the blown-up intersection cohomology and the Borel-Moore intersection homology, for any commutative ring of coefficients and second-countable, oriented…

Algebraic Topology · Mathematics 2020-09-22 Martintxo Saralegi-Aranguren , Daniel Tanré

In this article we undertake a study of extension complexity from the perspective of formal languages. We define a natural way to associate a family of polytopes with binary languages. This allows us to define the notion of extension…

Computational Complexity · Computer Science 2019-08-29 Hans Raj Tiwary

We study when the derived intersection of two smooth subvarieties of a smooth variety is formal. As a consequence we obtain a derived base change theorem for non-transversal intersections. We also obtain applications to the study of the…

Algebraic Geometry · Mathematics 2014-12-18 Dima Arinkin , Andrei Caldararu , Marton Hablicsek

We extend our approach to abstract syntax (with binding constructions) through modules and linearity. First we give a new general definition of arity, yielding the companion notion of signature. Then we obtain a modularity result as…

Logic in Computer Science · Computer Science 2008-09-09 Andre' Hirschowitz , Marco Maggesi

Working in a variant of the intersection type assignment system of Coppo, Dezani-Ciancaglini and Veneri [1981], we prove several facts about sets of terms having a given intersection type. Our main result is that every strongly normalizing…

Logic in Computer Science · Computer Science 2021-05-11 Richard Statman , Andrew Polonsky
‹ Prev 1 2 3 10 Next ›