相关论文: Polymorphic type inference for the relational alge…

Polynomial algebra offers a standard approach to handle several problems in geometric modeling. A key tool is the discriminant of a univariate polynomial, or of a well-constrained system of polynomial equations, which expresses the…

This note studies the behavior of Euler characteristics and of intersection homology Euler characterstics under proper morphisms of algebraic (or analytic) varieties. The methods also yield, for algebraic (or analytic) varieties, formulae…

We give a proof of I. G. Rosenberg's characterization of maximal clones. The theorem lists six types of relations on a finite set such that a clone over this set is maximal if and only if it contains just the functions preserving one of the…

We give the definition of presentations of linear monoidal categories. Our main result is that given a presentation of a linear monoidal category, we can produce a presentation of the same category as a linear category. We apply this result…

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$…

Isotopic pairs and their representations are considered in a general framework of the vector superalgebra. Numerous examples of finite-dimensional and infinite-dimensional isotopic pairs are discussed. Several types of their representations…

Polymorphic variants are a useful feature of the OCaml language whose current definition and implementation rely on kinding constraints to simulate a subtyping relation via unification. This yields an awkward formalization and results in a…

This article is an introduction to formal languages from the point of view of combinatorial group theory. Group theoretic applications are included and language classes are defined algebraically.

Universal algebra uniformly captures various algebraic structures, by expressing them as equational theories or abstract clones. The ubiquity of algebraic structures in mathematics and related fields has given rise to several variants of…

We formalize the general principle of significance with respect to binary relations which is a universal tool for description and analysis of various situations in and apart from mathematics. We derive the basic properties and focus on a…

The language of probability is used to define several different types of conditional statements. There are four principal types: subjunctive, material, existential, and feasibility. Two further types of conditionals are defined using the…

An explicit formula for a strong connection form in a principal extension by a coseparable coalgebra is given.

The real type of a finite family of univariate polynomials characterizes the combined sign behavior of the polynomials over the real line. We derive an explicit formula for the number of real types subject to given degree bounds. For the…

A plausible definition of "reasoning" could be "algebraically manipulating previously acquired knowledge in order to answer a new question". This definition covers first-order logical inference or probabilistic inference. It also includes…

In a previous paper, a process algebra based on ACP (Algebra of Communicating Processes) was proposed in which processes involving data can be handled by means of features originating from imperative programming. In this paper, an extension…

The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…

This is an exposition of some new results on associated primes and the depth of different kinds of powers of monomial ideals in order to show a deep connection between commutative algebra and some objects in combinatorics such as simplicial…

For every partial combinatory algebra (pca) $A$ and every partial endofunction on $A$, a pca $A[f]$ is constructed such that in $A[f]$, the function $f$ is representable by an element; a universal property of the construction is formulated…

A series of nonrepresentable relation algebras is constructed from groups. We use them to prove that there are continuum many subvarieties between the variety of representable relation algebras and the variety of coset relation algebras. We…

Martin-L\"of's Intuitionistic Theory of Types is becoming popular for formal reasoning about computer programs. To handle recursion schemes other than primitive recursion, a theory of well-founded relations is presented. Using primitive…