Related papers: Omitting unary and affine types

We present a type theory combining both linearity and dependency by stratifying typing rules into a level for logics and a level for programs. The distinction between logics and programs decouples their semantics, allowing the type system…

We propound the thesis that there is a limitation to the number of possible structures which are axiomatically endowed with identities involving operations. In the case of algebras with a binary operation satisfying a formally reducible (to…

The concept of_refinement_ in type theory is a way of reconciling the "intrinsic" and the "extrinsic" meanings of types. We begin with a rigorous analysis of this concept, settling on the simple conclusion that the type-theoretic notion of…

We classify all matroids with at most 8 elements that have the half-plane property, and we provide a list of some matroids on 9 elements that have, and that do not have the half-plane property. Furthermore, we prove that several classes of…

This paper introduces a simple type system for combinatory logic in which combinators have at most one type, whose polymorphism is revealed by application. The combinatory types exactly describe the structure of their values, which may be…

We establish a direct correspondence between two congruence poroperties for finite algebras. The first property is that minimal sets of type i omit tails. The second property is that congruence lattices omit pentagons of type i.

We study connections between additive and abelian 2-representations of fiat 2-categories, describe combinatorics of 2-categories in terms of multisemigroups and determine the annihilator of a cell 2-representation. We also describe, in…

We study infinite ternary words that contain few distinct palindromes. In particular, we classify such words according to their critical exponent.

Researchers have proposed a wide variety of model explanation approaches, but it remains unclear how most methods are related or when one method is preferable to another. We examine the literature and find that many methods are based on a…

Recently, it was shown that a binary linear code can be associated to a binomial ideal given as the sum of a toric ideal and a non-prime ideal. Since then two different generalizations have been provided which coincide for the binary case.…

We find finite-state recurrences to enumerate the words on the alphabet $[n]^r$ which avoid the patterns 123 and $1k(k-1)\dots2$, and, separately, the words which avoid the patterns 1234 and $1k(k-1)\dots2$.

We enumerate and characterize some classes of alternating and reverse alternating involutions avoiding a single pattern of length three or four. If on one hand the case of patterns of length three is trivial, on the other hand, the length…

We study a class of overdetermined algebraic systems of equations. We prove that the number of distinct solutions equals to the maximal possible if and only if certain matrices are commuting and semisimple. This gives a characterization of…

In this paper we present an extension of the removal lemma to integer linear systems over abelian groups. We prove that, if the $k$--determinantal of an integer $(k\times m)$ matrix $A$ is coprime with the order $n$ of a group $G$ and the…

We enumerate the number of 0/1-matrices avoiding 2x2 submatrices satisfying certain conditions. We also provide corresponding exponential generating functions.

The complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. We study infinite binary words $\bf w$ that avoid sufficiently large complementary factors; that is, if $x$ is a factor of…

We present a linear functional calculus with both the safety guarantees expressible with linear types and the rich language of combinators and composition provided by functional programming. Unlike previous combinations of linear typing and…

In this contribution we discuss flat discrete-time nonlinear systems in a general setting including two special subclasses, namely, forward- and backward-flat systems. We relate rank conditions for certain submatrices of the Jacobian of the…

A choice of optimization objective is immensely pivotal in the design of a recommender system as it affects the general modeling process of a user's intent from previous interactions. Existing approaches mainly adhere to three categories of…

We extend our investigation of $2$-determinants, which we defined in a previous paper. For a linear homogenous recurrence of the second order, we consider relations between different sequences satisfying the same linear homogeneous…