Related papers: Separating Path and Identity Types in Presheaf Mod…

We prove a theorem of Tits type for automorphism groups of projective varieties over an algebraically closed field of arbitrary characteristic, which was first conjectured by Keum, Oguiso and Zhang for complex projective varieties.

We establish a close connection between a reversible programming language based on type isomorphisms and a formally presented univalent universe. The correspondence relates combinators witnessing type isomorphisms in the programming…

The intended model of the homotopy type theories used in Univalent Foundations is the infinity-category of homotopy types, also known as infinity-groupoids. The problem of higher structures is that of constructing the homotopy types needed…

We study existence, uniqueness and triviality of path cocycles in the quantum Cayley graph of universal discrete quantum groups. In the orthogonal case we find that the unique path cocycle is trivial, in contrast with the case of free…

We study otopy classes of equivariant local maps and prove the Hopf type theorem for such maps in the case of a real finite dimensional orthogonal representation of a compact Lie group.

The central aim of this work is to understand rough differential equations on homogeneous spaces. We focus on the formal approach, by giving an explicit expansion of the solution at each point of the real line in terms of decorated planar…

The study of homotopy theoretic phenomena in the language of type theory is sometimes loosely called `synthetic homotopy theory'. Homotopy theory in type theory is only one of the many aspects of homotopy type theory, which also includes…

A tuple (s1,t1,s2,t2) of vertices in a simple undirected graph is 2-linked when there are two vertex-disjoint paths respectively from s1 to t1 and s2 to t2. A graph is 2-linked when all such tuples are 2-linked. We give a new and simple…

Our goal is to show that the standard model-theoretic concept of types can be applied in the study of order-invariant properties, i.e., properties definable in a logic in the presence of an auxiliary order relation, but not actually…

This text contributes to the foundations of the theory of global Berkovich spaces, that is to say Berkovich spaces over Banach rings with nice properties such as $\mathbf{Z}$, rings of integers of number fields, discrete valuation rings,…

We give the first examples of nef line bundles on smooth projective varieties over finite fields which are not semi-ample. More concretely, we find smooth curves on smooth projective surfaces over finite fields such that the normal bundle…

Within dependent type theory, we provide a topological counterpart of well-founded trees (for short, W-types) by using a proof-relevant version of the notion of inductively generated suplattices introduced in the context of formal topology…

A graphical model provides a compact and efficient representation of the association structure of a multivariate distribution by means of a graph. Relevant features of the distribution are represented by vertices, edges and other…

In this paper we define intensional models for the classical theory of types, thus arriving at an intensional type logic ITL. Intensional models generalize Henkin's general models and have a natural definition. As a class they do not…

Over a monoidal model category, under some mild assumptions, we equip the categories of colored PROPs and their algebras with projective model category structures. A Boardman-Vogt style homotopy invariance result about algebras over…

We show that the class of 1-exact operator systems is not uniformly definable by a sequence of types. We use this fact to show that there is no finitary version of Arveson's extension theorem. Next, we show that WEP is equivalent to a…

A typoid is a type equipped with an equivalence relation, such that the terms of equivalence between the terms of the type satisfy certain conditions, with respect to a given equivalence relation between them, that generalise the properties…

In this article, we provide an explicit description of a set of generators for any ideal of an ultragraph Leavitt path algebra. We provide several additional consequences of this description, including information about generating sets for…

We study d-dimensional generalizations of three mutually related topics in graph theory: Hamiltonian paths, (unit) interval graphs, and binomial edge ideals. We provide partial high-dimensional generalizations of Ore and Posa's sufficient…

We apply ideas from the theory of limits of dense combinatorial structures to study order types, which are combinatorial encodings of finite point sets. Using flag algebras we obtain new numerical results on the Erd\H{o}s problem of finding…