Related papers: Multisets in Type Theory
The extension of pattern avoidance from ordinary permutations to those on multisets gave birth to several interesting enumerative results. We study permutations on regular multisets, i.e., multisets in which each element occurs the same…
A theory of matchings for finite subsets of an abelian group, introduced in connection with a conjecture of Wakeford on canonical forms for homogeneous polynomials, has since been extended to the setting of field extensions and to that of…
In Martin-L\"of's Intensional Type Theory, identity type is a heavily used and studied concept. The reason for that is the fact that it's responsible for the recently discovered connection between Type Theory and Homotopy Theory. The main…
Axiomatizing mathematical structures and theories is an objective of Mathematical Logic. Some axiomatic systems are nowadays mere definitions, such as the axioms of Group Theory; but some systems are much deeper, such as the axioms of…
This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of set theory consists in establishing a refined version of Friedman's theorem on…
We develop a general formalism for representing and understanding structure in complex systems. In our view, structure is the totality of relationships among a system's components, and these relationships can be quantified using information…
Many introductions to homotopy type theory and the univalence axiom gloss over the semantics of this new formal system in traditional set-based foundations. This expository article, written as lecture notes to accompany a 3-part mini course…
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…
To any Young diagram we can associate the multiset of residues of all its nodes. This paper is concerned with the inverse problem: given a multiset of elements of Z/eZ, does it comes from a Young diagram? We give a full solution in level…
Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…
Archetypal analysis serves as an exploratory tool that interprets a collection of observations as convex combinations of pure (extreme) patterns. When these patterns correspond to actual observations within the sample, they are termed…
A model of Martin-L\"of extensional type theory with universes is formalized in Agda, an interactive proof system based on Martin-L\"of intensional type theory. This may be understood, we claim, as a solution to the old problem of modelling…
In the first part of this paper, we consider several natural axioms in urelement set theory, including the Collection Principle, the Reflection Principle, the Dependent Choice scheme and its generalizations, as well as other axioms…
Multi-task learning (MTL) is a supervised learning paradigm in which the prediction models for several related tasks are learned jointly to achieve better generalization performance. When there are only a few training examples per task, MTL…
Representing various networked data as multiplex networks, networks of networks and other multilayer networks can reveal completely new types of structures in these system. We introduce a general and principled graphlet framework for…
This text summarizes and expands the content of a general audience talk given in 2018 at the University of Mainz. Motivated by recent developments in dependent type theory and infinity category theory, it presents a history of ideas around…
It is well known that most constructive and predicative foundations aiming to develop Bishop's constructive analysis are incompatible with a classical predicative development of analysis as put forward by Weyl in his $\textit{Das…
Despite the remarkable success of large large-scale neural networks, we still lack unified notation for thinking about and describing their representational spaces. We lack methods to reliably describe how their representations are…
We study multiple recurrence properties along separated cross sections for pmp actions of unimodular lcsc group on Polish spaces. We establish a multiple transverse recurrence theorem under the assumption that sufficiently large powers of…
We show that Voevodsky's univalence axiom for intensional type theory is valid in categories of simplicial presheaves on elegant Reedy categories. In addition to diagrams on inverse categories, as considered in previous work of the author,…