相关论文: The impracticalities of multiplicatively-closed co…
We introduce a new framework called linear algebraic number theory (LANT) that reformulates the number-theoretic problem as a regression model and solves it using matrix algebra. This framework restricts all computations to log space,…
If a Lie algebra structures $\gG$ on a vector space is the sum of a family of mutually compatible Lie algebra structures $\gG_i$, we say that $\gG$ is \emph{simply assembled} from $\gG_s$'s. By repeating this procedure several times one…
Designing complex engineered systems requires managing tightly coupled trade-offs between subsystem capabilities and resource requirements. Monotone co-design provides a compositional language for such problems, but its generality does not…
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.…
Thin Lie algebras are infinite-dimensional graded Lie algebras $L=\bigoplus_{i=1}^{\infty}$, with $\dim(L_1)=2$ and satisfying a covering property: for each $i$, each nonzero $z\in L_i$ satisfies $[zL_1]=L_{i+1}$. It follows that each…
Every Lie algebra over a field $E$ gives rise to new Lie algebras over any subfield $F \subseteq E$ by restricting the scalar multiplication. This paper studies the structure of these underlying Lie algebra in relation to the structure of…
Conformal algebras, recently introduced by Kac, encode an axiomatic description of the singular part of the operator product expansion in conformal field theory. The objective of this paper is to develop the theory of ``multi-dimensional''…
Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…
An algebraic algorithm is developed for computation of invariants ('generalized Casimir operators') of general Lie algebras over the real or complex number field. Its main tools are the Cartan's method of moving frames and the knowledge of…
For some synchrotron light source beamline applications, a round beam is preferable to a flat one. A conventional method of obtaining round beam in an electron storage ring is to shift its tune close to a linear difference resonance. The…
We identify a common scheme in several existing algorithms addressing computational problems on linear differential equations with polynomial coefficients. These algorithms reduce to computing a linear relation between vectors obtained as…
We prove a structure theorem for Lie n-algebras possessing an invariant inner product. We define the notion of a double extension of a metric Lie n-algebra by another Lie n-algebra and prove that all metric Lie n-algebras are obtained from…
Given a hyperplane arrangement in a complex vector space of dimension n, there is a natural associated arrangement of codimension k subspaces in a complex vector space of dimension k*n. Topological invariants of the complement of this…
We give a simple proof of why there is a Matrix theory approximation for a membrane shaped like an arbitrary Riemann surface. As corollaries, we show that noncompact membranes cannot be approximated by matrices and that the Poisson algebra…
We study numerically the ODE/IM correspondence for untwisted affine Lie algebras associated with simple Lie algebras including exceptional type. We consider the linear problem obtained from the massless limit of that of the modified affine…
We study the differential structure of the set of real logarithms of a non-singular real matrix, under the assumption that the matrix is either semi-simple or orthogonal.
A graph is concave-round if its vertices can be circularly enumerated so that the closed neighbourhood of each vertex is an interval in the enumeration. In this work, we give a minimal forbidden induced subgraph characterization for the…
There are two primary approaches to solving Markov decision problems (MDPs): dynamic programming based on the Bellman equation and linear programming (LP). Dynamic programming methods are the most widely used and form the foundation of both…
We generalize several important results from the perturbation theory of linear operators to the setting of semisimple orthogonal symmetric Lie algebras. These Lie algebras provide a unifying framework for various notions of matrix…
Lie algebras provide a useful framework for theoretical analysis in quantum machine learning, particularly in hybrid quantum-classical learning. From the viewpoint of function approximation, expectation values of parameterized quantum…