Related papers: Epimorphisms between linear orders
Ordered, linear, and other substructural type systems allow us to expose deep properties of programs at the syntactic level of types. In this paper, we develop a family of unary logical relations that allow us to prove consequences of…
We study ergodic decompositions of Dirichlet spaces under intertwining via unitary order isomorphisms. We show that the ergodic decomposition of a quasi-regular Dirichlet space is unique up to a unique isomorphism of the indexing space.…
In the literature of the study of knot group epimorphisms, the existence of an epimorphism between two given knot groups is mostly (if not always) shown by giving an epimorphism which preserves meridians. A natural question arises: is there…
This work is a continuation of [13]. We study the linear disjointness between higher-order oscillating sequences and nonlinear dynamical systems. Specifically, we prove that any oscillating sequence of order $m=d+k-1$ and any simple…
We consider bivariate polynomials orthogonal on the bicircle with respect to a positive linear functional. The lexicographical and reverse lexicographical orderings are used to order the monomials. Recurrence formulas are derived between…
We construct a monadic second-order sentence that characterizes the ternary relations that are the betweenness relations of finite or infinite partial orders. We prove that no first-order sentence can do that. We characterize the partial…
We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.
The notion of bounded expansion captures uniform sparsity of graph classes and renders various algorithmic problems that are hard in general tractable. In particular, the model-checking problem for first-order logic is fixed-parameter…
Order effects occur when judgments about a hypothesis's probability given a sequence of information do not equal the probability of the same hypothesis when the information is reversed. Different experiments have been performed in the…
Let $T$ be a countable complete first-order theory with a definable, infinite, discrete linear order. We prove that $T$ has continuum-many countable models. The proof is purely first-order, but raises the question of Borel completeness of…
We prove that the isomorphism of scattered tree automatic linear orders as well as the existence of automorphisms of scattered word automatic linear orders are undecidable. For the existence of automatic automorphisms of word automatic…
Derivations extend the concept of differentiation from functions to algebraic structures as linear operators satisfying the Leibniz rule. In Lie algebras, derivations form a Lie algebra via the commutator bracket of linear endomorphisms.…
We discuss the notion of linearization through examples, which include the Price map, PageRank, representation theory, the Euler characteristic and quantum invariants. We also review categorification, which adds an additional layer of…
We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…
A filtration of the morphisms of the $k$-linearization $k \mathbf{FS}$ of the category $\mathbf{FS}$ of finite sets and surjections is constructed using a natural $k \mathbf{FI}^{op}$-module structure induced by restriction, where…
It is classical that univariate algebraic functions satisfy linear differential equations with polynomial coefficients. Linear recurrences follow for the coefficients of their power series expansions. We show that the linear differential…
In this note we introduce a new technique to answer an issue posed in [7] concerning geometric properties of the set of non-surjective linear operators. We also extend and improve a related result from the same paper.
We use a recently found method to characterise all the invertible fourth-order difference equations linear in the extremal values based on the existence of a discrete Lagrangian. We also give some result on the integrability properties of…
In this work, we explore proof theoretical connections between sequent, nested and labelled calculi. In particular, we show a general algorithm for transforming a class of nested systems into sequent calculus systems, passing through linear…
We study continuous homomorphisms between algebras of iterated Laurent series over a commutative ring. We give a full description of such homomorphisms in terms of a discrete data determined by the images of parameters. In similar terms, we…