Related papers: ELT Linear Algebra
We introduce and investigate the concept of Stratified Algebra, a new algebraic framework equipped with a layer-based structure on a vector space. We formalize a set of axioms governing intra-layer and inter-layer interactions, study their…
The equivalence transformation algebra $L_{\cal E}$ for the class of equations $u_t -u_{xx}=f(u, u_x) $ is obtained. After getting the differential invariants with respect to $L_{\cal E}$, some results which allow to linearize a subclass of…
The Euler Characteristic Transform (ECT) has proven to be a powerful representation, combining geometrical and topological characteristics of shapes and graphs. However, the ECT was hitherto unable to learn task-specific representations. We…
Concise introduction to a relatively new subject of non-linear algebra: literal extension of text-book linear algebra to the case of non-linear equations and maps. This powerful science is based on the notions of discriminant…
Learning-to-rank (LTR) is a class of supervised learning techniques that apply to ranking problems dealing with a large number of features. The popularity and widespread application of LTR models in prioritizing information in a variety of…
In this note we prove that the algebras $L_K(E)$ and $KE$ have the same entropy. Entropy is always referred to the standard filtrations in the corresponding kind of algebra. The main argument leans on (1) the holomorphic functional…
We develop a purely combinatorial theory of limit linear series on metric graphs. This will be based on the formalisms of hypercube rank functions and slope structures. We provide a full classification of combinatorial limit linear series…
The max-Lukasiewicz semiring is defined as the unit interval [0,1] equipped with the arithmetics "a+b"=max(a,b) and "ab"=max(0,a+b-1). Linear algebra over this semiring can be developed in the usual way. We observe that any problem of the…
Weighted programs generalize probabilistic programs and offer a framework for specifying and encoding mathematical models by means of an algorithmic representation. Kleene algebra with tests is an algebraic formalism based on regular…
Assuming a large cardinal hypothesis, Laver gave a representation of the monogenerated free left distributive algebra (LDA) using elementary embeddings and used this representation to prove many algebraic results. Some of these results were…
For every finitary monad $T$ on sets and every endofunctor $F$ on the category of $T$-algebras we introduce the concept of an ffg-Elgot algebra for $F$, that is, an algebra admitting coherent solutions for finite systems of recursive…
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…
We introduce a notion of elliptic differential graded Lie algebra. The class of elliptic algebras contains such examples as the algebra of differential forms with values in endomorphisms of a flat vector bundle over a compact manifold, etc.…
For any power series $a(t)$ with exponentially bounded nonnegative integer coefficients we suggest a simple construction of a finitely generated monomial associative algebra $R$ with Hilbert series $H(R,t)$ very close to $a(t)$. If $a(t)$…
Calibration of mean estimates for predictions is a crucial property in many applications, particularly in the fields of financial and actuarial decision-making. In this paper, we first review classical approaches for validating…
This paper introduces and systematically studies Weyl-type, Witt-type, and non-associative algebras defined over expolynomial rings -- commutative rings generated by exponential functions $e^{\alpha x}$, exponentials of exponentials $e^{\pm…
Relationship is clarified between the notions of linear extension of algebraic theories, and central extension, in the sense of commutator calculus, of their models. Varieties of algebras turn out to be nilpotent Maltsev precisely when…
We show that Csanky's fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LAP from the principle of linear independence. LAP is a natural…
We consider the bt-algebra ${ \mathcal E}_n(q)$ of knot theory, defined over an arbitrary field $ \Bbbk$. We find a KLR-like presentation for $ {\mathcal E}_n(q) $ showing that it is a $ \mathbb Z$-graded algebra if $ q \in \Bbbk^{\times}…
We present a finite difference version of the eth formalism, which allows use of tensor fields in spherical coordinates in a manner which avoids polar singularities. The method employs two overlapping stereographic coordinate patches, with…