Related papers: On the equivalence of types

We study the class of 2-dimensional affine k-domains R satisfying ML(R) = k, where k is an arbitrary field of characteristic zero. In particular, we obtain the following result: Let R be a localization of a polynomial ring in finitely many…

For an arbitrary field $K$ and $K$-variety $V$, we introduce the \'etale-open topology on the set $V(K)$ of $K$-points of $V$. This topology agrees with the Zariski topology, Euclidean topology, or valuation topology when $K$ is separably…

We prove that two finite prime $\Omega$-algebras defined over the same unital commutative ring and satisfying the same set of polynomial identities are isomorphic.

We consider differential rings of the form (K[x; y];D), where K is an algebraically closed field of characteristic zero and D : K[x; y] \to K[x; y] is a K-derivation. We study the Automorphism Group of such a ring and give criteria for…

Liouville closed $H$-fields are ordered differential fields whose ordering and derivation interact in a natural way and where every linear differential equation of order $1$ has a nontrivial solution. (The introduction gives a precise…

We show that many theorems which assert that two kinds of partitions of the same integer $n$ are equinumerous are actually special cases of a much stronger form of equality. We show that in fact there correspond partition statistics $X$ and…

A univariate polynomial f over a field is decomposable if it is the composition f = g(h) of two polynomials g and h whose degree is at least 2. We determine the dimension (over an algebraically closed field) of the set of decomposables, and…

Typology is a subfield of linguistics that focuses on the study and classification of languages based on their structural features. Unlike genealogical classification, which examines the historical relationships between languages, typology…

A dimension group is a partially ordered countable group such that (1) every finite subset is contained in an ordered subgroup which is a finite direct power of Z and (2) the group has an order unit i.e. a positive element u such that every…

Multi-indexed orthogonal polynomials describe eigenfunctions of exactly solvable shape-invariant quantum mechanical systems in one dimension obtained by the method of virtual states deletion. Multi-indexed orthogonal polynomials are labeled…

This paper presents a type theory in which it is possible to directly manipulate $n$-dimensional cubes (points, lines, squares, cubes, etc.) based on an interpretation of dependent type theory in a cubical set model. This enables new ways…

A hierarchy of matrix-valued polynomials which generalize the Jacobi polynomials is found. Defined by a Rodrigues formula, they are also products of a sequence of differential operators. Each class of polynomials is complete, satisfies a…

We present various constructions of sequences of polynomials satisfying the Binomial Theorem in finite characteristic based on the theory of additive polynomials. Various actions on these constructions are also presented. It is an open…

We show that a reflective/coreflective pair of full subcategories satisfies a "maximal-normal"-type equivalence if and only if it is an associated pair in the sense of Kelly and Lawvere.

Polynomials and elements over finite fields exhibit closely related algebraic structures, and many properties defined for elements extend naturally to polynomials. The concepts of order and $\mathbb{F}_q$-Order for elements have been…

We investigate affine Berkovich spaces over maximally complete fields and prove that they may be approximated by simpler spaces when the only functions we need to evaluate are polynomials of bounded degree. We derive applications to…

We prove that for every indecomposable ordinal there exists a (transfinitely valued) Euclidean domain whose minimal Euclidean norm is of that order type. Conversely, any such norm must have indecomposable type, and so we completely…

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…

Suppose $\Lambda$ is a discrete infinite set of nonnegative real numbers. We say that $ {\Lambda}$ is type $1$ if the series $s(x)=\sum_{\lambda\in\Lambda}f(x+\lambda)$ satisfies a zero-one law. This means that for any non-negative…

Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…