Related papers: ELT Linear Algebra II
We present the formalism of Time-dependent Exchange Perturbation Theory (TDEPT) built to all orders of perturbation, for the arbitrary time dependency of perturbation. The theory takes into account the rearrangement of electrons among…
Recursive algebraic data types (term algebras, ADTs) are one of the most well-studied theories in logic, and find application in contexts including functional programming, modelling languages, proof assistants, and verification. At this…
Large Language Models (LLMs) often exhibit a gap between their internal knowledge and their explicit linguistic outputs. In this report, we empirically investigate whether Looped Transformers (LTs)--architectures that increase computational…
We prove the Central Limit Theorem (CLT) from the definition of weak convergence using the Haar wavelet basis, calculus, and elementary probability. The use of the Haar basis pinpoints the role of $L^{2}([0,1])$ in the CLT as well as the…
In this paper motivated by the celebrated fundamental theorem of algebra and its standard proof utilizing Liouville's Theorem, we prove the fundamental theorem of algebra type results for both commutative and noncommutative polynomials in…
We introduce a class of iterated integrals, defined through a set of linearly independent integration kernels on elliptic curves. As a direct generalisation of multiple polylogarithms, we construct our set of integration kernels ensuring…
Empirical Likelihood (EL) is a type of nonparametric likelihood that is useful in many statistical inference problems, including confidence region construction and $k$-sample problems. It enjoys some remarkable theoretical properties,…
We introduce a bt-algebra of type B. We define this algebra doing the natural analogy with the original construction of the bt-algebra. Notably we find a basis for it, a faithful tensorial representation, and we prove that it supports a…
A bitmap is a data structure designed to compactly represent sets of integers; it provides very fast operations for querying and manipulating such sets, exploiting bit-level parallelism. In this paper, we describe a technique for the…
We show how Seifert surfaces, so useful for the understanding of the Alexander polynomial \Delta_L(t), can be generalized in order to study the multivariable Alexander polynomial \Delta_L(t_1,...,t_\mu). In particular, we give an elementary…
The enhanced binary tree (EBT) is a nontransitive graph which has two percolation thresholds $p_{c1}$ and $p_{c2}$ with $p_{c1}<p_{c2}$. Our Monte Carlo study implies that the second threshold $p_{c2}$ is significantly lower than a recent…
To be usable in practice, interactive theorem provers need to provide convenient and efficient means of writing expressions, definitions, and proofs. This involves inferring information that is often left implicit in an ordinary…
This note provides some technical support to the proof of a result of W. Winter which shows that two unital separable simple amenable ${\cal Z}$-absorbing C*-algebras with locally finite decomposition property satisfying the UCT whose…
Evolutionary multitasking (EMT) is an emerging approach for solving multitask optimization problems (MTOPs) and has garnered considerable research interest. The implicit EMT is a significant research branch that utilizes evolution operators…
In this paper we investigate using the methodology of algebraic logic, deep algebraic results to prove three new omitting types theorems for finite variable fragments of first order logic. As a sample, we show that it T is an L_n theory and…
Boolean-type algebra (BTA) is investigated. A BTA is decomposed into Boolean-type lattice (BTL) and a complementation algebra (CA). When the object set is finite, the matrix expressions of BTL and CA (and then BTA) are presented. The…
The linearized double shuffle Lie algebra $\mathfrak{ls}$ is a well-studied Lie algebra, which reflects the depth-graded structure of multiple zeta values. We introduce a generalization $\mathfrak{lq}$, which is motivated from the…
The Taylor expansion is a widely used and powerful tool in all branches of Mathematics, both pure and applied. In Probability and Mathematical Statistics, however, a stronger version of Taylor's classical theorem is often needed, but only…
This paper describes the development of finite abstractions of Max-Plus-Linear (MPL) systems using tropical operations. The idea of tropical abstraction is inspired by the fact that an MPL system is a discrete-event model updating its state…
The algebraic foundation of tropical polynomial algebra provides the framework for the geometric construction of the supplement and the reversal of tropical varieties, thereby inducing a duality of reduced tropical varieties; for classes of…