Related papers: Algebraic Linear Orderings
Borrowing inspiration from Marcone and Mont\'{a}lban's one-one correspondence between the class of signed trees and the equimorphism classes of indecomposable scattered linear orders, we find a subclass of signed trees which has an…
An ordered set-partition (or preferential arrangement) of n labeled elements represents a single ``hierarchy''; these are enumerated by the ordered Bell numbers. In this note we determine the number of ``hierarchical orderings'' or…
We give an algebraic characterization of half-factorial orders in algebraic number fields. This generalizes prior results for seminormal orders and for orders in quadratic number fields.
We provide a computational definition of the notions of vector space and bilinear functions. We use this result to introduce a minimal language combining higher-order computation and linear algebra. This language extends the Lambda-calculus…
Let $\mathcal{O}$ be an order in an algebraic number field and suppose that the set of distances $\Delta(\mathcal{O})$ of $\mathcal{O}$ is nonempty (equivalently, $\mathcal{O}$ is not half-factorial). If $\mathcal{O}$ is seminormal (in…
Given an associative, not necessarily commutative, ring R with identity, a formal matrix calculus is introduced and developed for pairs of matrices over R. This calculus subsumes the theory of homogeneous systems of linear equations with…
Hemaspaandra, Hempel, and Wechsung [cs.CC/9909020] initiated the field of query order, which studies the ways in which computational power is affected by the order in which information sources are accessed. The present paper studies, for…
The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic…
This paper focuses on resolution in linguistic first order logic with truth value taken from linear symmetrical hedge algebra. We build the basic components of linguistic first order logic, including syntax and semantics. We present a…
Pattern matching is a popular feature in functional, imperative and object-oriented programming languages. Language designers should therefore invest effort in a good design for pattern matching. Most languages choose a first-match…
The bivariate difference field provides an algebraic framework for a sequence satisfying a recurrence of order two. Based on this, we focus on sequences satisfying a recurrence of higher order, and consider the multivariate difference…
We define an easily verifiable notion of an atomic formula having uniformly bounded arrays in a structure $M$. We prove that if $T$ is a complete $L$-theory, then $T$ is mutually algebraic if and only if there is some model $M$ of $T$ for…
This paper studies a partial order on the general linear group GL(V) called the absolute order, derived from viewing GL(V) as a group generated by reflections, that is, elements whose fixed space has codimension one. The absolute order on…
The relative algebraic monodromy of abelian logarithms (defined as the kernel of a map between algebraic monodromy groups attached to an abelian scheme with and without a section) was computed in \cite{A1}: under natural assumptions, this…
Let $B$ be a central simple algebra of degree $n$ over a number field $K$, and $L\subset B$ a strictly maximal subfield. We say that the ring of integers $\mathcal O_L$ is "selective" if there exists an isomorphism class of maximal orders…
Given a generic semidefinite program, specified by matrices with rational entries, each coordinate of its optimal solution is an algebraic number. We study the degree of the minimal polynomials of these algebraic numbers. Geometrically,…
We study a class of combinatorial objects that we call "decorated trees". These consist of vertices, arrows and edges, where each edge is decorated by two integers (one near each of its endpoints), each arrow is decorated by an integer, and…
Identification of fractional order systems is considered from an algebraic point of view. It allows for a simultaneous estimation of model parameters and fractional (or integer) orders from input and output data. It is exact in that no…
We prove the following classification theorem of the ``Glimm -- Effros'' type for Borel order relations: a Borel partial order on the reals either is Borel linearizable or includes a copy of a certain Borel partial order $\meo$ which is not…
A central problem of linear algebra is solving linear systems. Regarding linear systems as equations over general semirings (V,otimes,oplus,0,1) instead of rings or fields makes traditional approaches impossible. Earlier work shows that the…