相关论文: Nominal Sets in Agda -- A Fresh and Immature Mecha…

We survey the known results about simple permutations. In particular, we present a number of recent enumerative and structural results pertaining to simple permutations, and show how simple permutations play an important role in the study…

A subclass of nondeterministic Finite Automata generated by means of regular Grammars (GFAs, for short) is introduced. A process algebra is proposed, whose semantics maps a term to a GFA. We prove a representability theorem: for each GFA…

We introduce a new type of means. It is new in two ways: its domain consists of sets and its values are sets too. We investigate the properties and behavior of such generalization. We also present many naturally arisen examples for such…

A minimal permutation representation of a finite group G is a faithful G-set with the smallest possible size. We study the structure of such representations and show that for certain groups they may be obtained by a greedy construction. In…

We initiate a systematic study of the perfection of affine group schemes of finite type over fields of positive characteristic. The main result intrinsically characterises and classifies the perfections of reductive groups, and obtains a…

Theorem provers are tools that help users to write machine readable proofs. Some of this tools are also interactive. The need of such softwares is increasing since they provide proofs that are more certified than the hand written ones. Agda…

In this paper, we study the weighted difference substitutions from geometrical views. First, we give the geometric meanings of the weighted difference substitutions, and introduce the concept of convergence of the sequence of substitution…

Due to the increased complexity of software development projects more and more systems are described by models. The sheer size makes it impractical to describe these systems by a single model. Instead many models are developed that provide…

We find the model completion of the theory modules over $A$, where $A$ is a finitely generated commutative algebra over a field $K$. This is done in a context where the field $K$ and the module are represented by sorts in the theory, so…

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

Ten years ago, it was shown that nominal techniques can be used to design coalgebraic data types with variable binding, so that alpha-equivalence classes of infinitary terms are directly endowed with a corecursion principle. We introduce…

We study nominal anti-unification, which is concerned with computing least general generalizations for given terms-in-context. In general, the problem does not have a least general solution, but if the set of atoms permitted in…

Permutation polynomials are an interesting subject of mathematics and have applications in other areas of mathematics and engineering. In this paper, we develop general theorems on permutation polynomials over finite fields. As a…

This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…

We investigate finite deterministic automata in sets with non-homogeneous atoms: integers with successor. As there are uncount- ably many deterministic finite automata in this setting, we restrict our attention to automata with semilinear…

Abstract separation systems are a new unifying framework in which separations of graph, matroids and other combinatorial structures can be expressed and studied. We characterize the abstract separation systems that have representations as…

The class of finitely presented algebras over a field $K$ with a set of generators $a_{1},..., a_{n}$ and defined by homogeneous relations of the form $a_{1}a_{2}... a_{n} =a_{\sigma (1)} a_{\sigma (2)} ... a_{\sigma (n)}$, where $\sigma$…

Recent works by Asada, Ong and Tsukada have championed a rigid description of resources. Whereas in non-rigid paradigms (e.g., standard Taylor expansion or non-idempotent intersection types), bags of resources are multisets and invariant…

We define two new families of polynomials that generalize permanents and prove upper and lower bounds on their determinantal complexities comparable to the known bounds for permanents. One of these families is obtained by replacing…

A fertile field of research in theoretical computer science investigates the representation of general recursive functions in intensional type theories. Among the most successful approaches are: the use of wellfounded relations,…