English
Related papers

Related papers: Linearization of analytic order relations

200 papers

In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…

Computational Complexity · Computer Science 2019-01-01 Laurent Lyaudet

This paper contains results concerning the Borel reduction of the relation $E_0$ of eventual agreement between sequences of 0's and 1's, to the relation of permutative equivalence between basic sequences in a Banach space. For more clarity…

Functional Analysis · Mathematics 2007-05-23 Valentin Ferenczi

We introduce normal cores, as well as the more general action cores, in the context of a semi-abelian category, and further generalise those to split extension cores in the context of a homological category. We prove that, if the category…

Category Theory · Mathematics 2023-07-26 D. Bourn , A. S. Cigoli , J. R. A. Gray , T. Van der Linden

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…

Logic · Mathematics 2019-02-06 Samuel Coskey , Joel David Hamkins , Russell Miller

Suppose $E \subseteq \mathbb{R}$ is nowhere dense. If $(\mathbb{R},<,+,(x \mapsto \lambda x)_{\lambda \in \mathbb{R} }, E)$ does not define every bounded Borel subset of every $\mathbb{R}^n$ then for every $s > 0$ we have $$ | \{ k \in…

Logic · Mathematics 2020-10-21 Erik Walsberg

We prove in this paper that there exists some infinitary rational relations which are Sigma^0_3-complete Borel sets and some others which are Pi^0_3-complete. This implies that there exists some infinitary rational relations which are…

Logic in Computer Science · Computer Science 2010-07-26 Olivier Finkel

An important conjecture in additive combinatorics, number theory, and algebraic geometry posits that the partition rank and analytic rank of tensors are equal up to a constant, over any finite field. We prove the conjecture up to a…

Combinatorics · Mathematics 2024-11-04 Guy Moshkovitz , Daniel G. Zhu

We prove an algebraic canonicity theorem for normal LE-logics of arbitrary signature, in a generalized setting in which the non-lattice connectives are interpreted as operations mapping tuples of elements of the given lattice to closed or…

Logic · Mathematics 2021-02-23 Laurent De Rudder , Alessandra Palmigiano

In this exposition, we get examples of what is called a "linear hyperdoctrine", based on categories of comodules indexed by coalgebras. This structures can model first order linear logic.

Logic · Mathematics 2016-12-21 Mariana Haim , Octavio Malherbe

A characterization of the symmetry algebra of the $n$th order ordinary differential equations (ODEs) with maximal symmetry and all third order linearizable ODEs is given. This is used to show that such an algebra $\mathfrak{g}$ determines…

Classical Analysis and ODEs · Mathematics 2020-06-25 Sajid Ali , Hassan Azad , Said Waqas Shah , Fazal M. Mahomed

We associate in a natural way to any partially ordered set $(P,\leq)$ a directed graph $E_P$ (where the vertices of $E_P$ correspond to the elements of $P$, and the edges of $E_P$ correspond to related pairs of elements of $P$), and then…

Rings and Algebras · Mathematics 2017-02-21 Gene Abrams , Gonzalo Aranda Pino , Zachary Mesyan , Christopher Smith

Continual Lie algebras are infinite-dimensional generalizations of Lie algebras with discrete root system by considering continual root systems. In this paper we establish the general relation between chain complexes and continual Lie…

Functional Analysis · Mathematics 2026-05-20 A. Zuevsky

We study the complexity of isomorphism of classes of metric structures using methods from infinitary continuous logic. For Borel classes of locally compact structures, we prove that if the equivalence relation of isomorphism is potentially…

Logic · Mathematics 2021-09-20 Andreas Hallbäck , Maciej Malicki , Todor Tsankov

Let $A$ be a, not necessarily closed, linear relation in a Hilbert space $\sH$ with a multivalued part $\mul A$. An operator $B$ in $\sH$ with $\ran B\perp\mul A^{**}$ is said to be an operator part of $A$ when $A=B \hplus (\{0\}\times \mul…

Functional Analysis · Mathematics 2009-07-01 S. Hassi , H. S. V. de Snoo , F. H. Szafraniec

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…

Symbolic Computation · Computer Science 2008-04-03 Alin Bostan , Frédéric Chyzak , Bruno Salvy , Grégoire Lecerf , Éric Schost

We carry out the classification of abelian Lie symmetry algebras of two-dimensional second-order nondegenerate quasilinear evolution equations. It is shown that such an equation is linearizable if it admits an abelian Lie symmetry algebra…

Exactly Solvable and Integrable Systems · Physics 2020-12-08 Rohollah Bakhshandeh-Chamazkoti

Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…

Number Theory · Mathematics 2011-04-21 Andreas Philipp

This paper illustrates the relationship between boolean propositional algebra and semirings, presenting some results of partial ordering on boolean propositional algebras, and the necessary conditions to represent a boolean propositional…

Rings and Algebras · Mathematics 2009-06-26 Mahesh Rudrachar , Shrisha Rao , Amit Raj

The existence of a semiconjugate relation permits the transformation of a higher order difference equation on a group into an equivalent triangular system of two difference equations of lower orders. Introducing time-dependent form…

Exactly Solvable and Integrable Systems · Physics 2012-03-02 Hassan Sedaghat

Each Multiplicative Exponential Linear Logic (MELL) proof-net can be expanded into a differential net, which is its Taylor expansion. We prove that two different MELL proof-nets have two different Taylor expansions. As a corollary, we prove…

Logic in Computer Science · Computer Science 2023-06-22 Daniel de Carvalho