Related papers: Uniqueness typing for intersection types

Strong typicality and the Markov lemma have been used in the proofs of several multiterminal source coding theorems. Since these two tools can be applied to finite alphabets only, the results proved by them are subject to the same…

We compute the automorphism scheme of a generic odd dimensional $(2,2)$-complete intersection in characteristic $2$. This is the only case for complete intersections having a non-trivial identity component in automorphism schemes apart from…

Let $G$ be a finite group and let $N$ be a normal subgroup of $G$. We attach to $N$ two graphs ${\Gamma}_G(N)$ and ${\Gamma}^{\ast}_G(N)$ related to the conjugacy classes of $G$ contained in $N$ and to the set of primes dividing the sizes…

System I is a recently introduced simply-typed lambda calculus with pairs where isomorphic types are considered equal. In this work we propose a variant of System I with the type Top, and present a complete formalization of this calculus in…

We introduce the notion of $(\Gamma,E)$-determinacy for $\Gamma$ a pointclass and $E$ an equivalence relation on a Polish space $X$. A case of particular interest is the case when $E=E_G$ is the (left) shift-action of $G$ on $S^G$ where…

If $G(M)$ denotes the subgraph of a graph $G$ induced by the set of vertices that are covered by some matching $M$ in $G$, then $M$ is an induced or a uniquely restricted matching if $G(M)$ is $1$-regular or if $M$ is the unique perfect…

We show that the principal types of the closed terms of the affine fragment of $\lambda$-calculus, with respect to a simple type discipline, are structurally isomorphic to their interpretations, as partial involutions, in a natural Geometry…

Two mesh patterns are coincident if they are avoided by the same set of permutations. In this paper, we provide necessary conditions for this coincidence, which include having the same set of enclosed diagonals. This condition is sufficient…

Let $\Gamma\subseteq\text{PSL}(2, \mathbb{R})$ correspond to the group of units of norm $1$ in an Eichler order $\mathrm{O}$ of an indefinite quaternion algebra over $\mathbb{Q}$. Closed geodesics on $\Gamma\backslash\mathbb{H}$ correspond…

On the topic of probabilistic rewriting, there are several works studying both termination and confluence of different systems. While working with a lambda calculus modelling quantum computation, we found a system with probabilistic…

Suppose a smooth planar curve $\gamma$ is $2\pi$-periodic in the $x$ direction and the length of one period is $\ell$. It is shown that if $\gamma$ self-intersects, then it has a segment of length $\ell- 2\pi$ on which it self-intersects…

A graph $\Gamma$ is $G$-symmetric if $G$ is a group of automorphisms of $\Gamma$ which is transitive on the set of ordered pairs of adjacent vertices of $\Gamma$. If $V(\Gamma)$ admits a nontrivial $G$-invariant partition ${\cal B}$ such…

We give a stopping criterion for the enumeration of all conjugacy classes in cocompact triangle groups up to any geometric length. The enumeration is based on an encoding given by P. Dehornoy and T. Pinsky.

This thesis generalizes the study of $C\cap(C + \alpha)$ where $C$ is the middle third Cantor set to self-affine sets in $\mathbb{R}^{n}$. We present sufficient and necessary conditions for when the translation $\alpha$ produces a…

We study the complete intersection property of monomial curves in the family $\Gamma_{\aa + \jj} = {(t^{a_0 + j}, t^{a_1+j},..., t^{a_n + j}) ~ | ~ j \geq 0, ~ a_0 < a_1 <...< a_n}$. We prove that if $\Gamma_{\aa+\jj}$ is a complete…

We study the class of simple graphs $\mathcal{G}^*$ for which every pair of distinct odd cycles intersect in at most one edge. We give a structural characterization of the graphs in $\mathcal{G}^*$ and prove that every $G \in \mathcal{G}^*$…

We introduce two-sided type systems, which are sequent calculi for typing formulas. Two-sided type systems allow for hypothetical reasoning over the typing of compound program expressions, and the refutation of typing formulas. By…

We show that each perfect matching in a bipartite graph $G$ intersects at least half of the perfect matchings in $G$. This result has equivalent formulations in terms of the permanent of the adjacency matrix of a graph, and in terms of…

Let us say that a Cayley graph $\Gamma$ of a group $G$ of order $n$ is a Cerny Cayley graph if every synchronizing automaton containing $\Gamma$ as a subgraph with the same vertex set admits a synchronizing word of length at most $(n-1)^2$.…

Let (R, m) be the semigroup ring associated to a numerical semigroup S. In this paper we study the property of its associated graded ring G(m) to be Complete Intersection. In particular, we introduce and characterise beta-rectangular and…