English
Related papers

Related papers: Some derivations among Logarithmic Space Bounded C…

200 papers

The Lie algebra of planar vector fields with coefficients from the field of rational functions over an algebraically closed field of characteristic zero is considered. We find all finite-dimensional Lie algebras that can be realized as…

Rings and Algebras · Mathematics 2013-01-10 Ievgen Makedonskyi , Anatoliy Petravchuk

We consider two classes of computations which admit taking linear combinations of execution runs: probabilistic sampling and generalized animation. We argue that the task of program learning should be more tractable for these architectures…

Logic in Computer Science · Computer Science 2015-12-17 Michael Bukatin , Steve Matthews

For a class of non compact Riemannian manifolds with ends, we give pseudo-differential expansions of bounded functions of the semi-classical Laplacian and study related Lp boundedness properties.

Analysis of PDEs · Mathematics 2007-11-26 Jean-Marc Bouclet

In a recent paper, the author has shown how Interaction Graphs models for linear logic can be used to obtain implicit characterisations of non-deterministic complexity classes. In this paper, we show how this semantic approach to Implicit…

Computational Complexity · Computer Science 2020-02-04 Thomas Seiller

In this paper I consider locally finite Lie algebras of characteristic zero satisfying the condition that for every finite number of elements $x_{1}, x_{2},..., x_{k}$ of such an algebra $L$ there is finite-dimensional subalgebra $A$ which…

Rings and Algebras · Mathematics 2007-05-23 L. A. Simonian

We study computational aspects of relational marginal polytopes which are statistical relational learning counterparts of marginal polytopes, well-known from probabilistic graphical models. Here, given some first-order logic formula, we can…

Artificial Intelligence · Computer Science 2020-01-16 Ondrej Kuzelka , Yuyi Wang

Lie algebras are an important class of algebras which arise throughout mathematics and physics. We report on the formalisation of Lie algebras in Lean's Mathlib library. Although basic knowledge of Lie theory will benefit the reader, none…

Logic in Computer Science · Computer Science 2021-12-10 Oliver Nash

We determine precisely the number of irreducible summands of an irreducible cross characteristic representation of $GL_{n}(q)$ on restriction to $SL_{n}(q)$. Combined with a recent result of C. Bonnafe, this yields a canonical labeling for…

Representation Theory · Mathematics 2008-10-07 Alexander S. Kleshchev , Pham Huu Tiep

We develop a categorical compositional distributional semantics for Lambek Calculus with a Relevant Modality !L*, which has a limited edition of the contraction and permutation rules. The categorical part of the semantics is a monoidal…

Computation and Language · Computer Science 2024-08-07 Lachlan McPheat , Mehrnoosh Sadrzadeh , Hadi Wazni , Gijs Wijnholds

The ideals of the Lie algebras of unitriangular polynomial derivations are classified. An isomorphism criterion is given for the Lie factor algebras of the Lie algebras of unitriangular polynomial derivations.

Rings and Algebras · Mathematics 2015-06-04 V. V. Bavula

On a reasonable class of domains in $\CC^n$, we characterize those holomorphic functions which continue analytically past the boundary. Then we give some applications of this result to holomorphic mappings. In addition, some new results…

Complex Variables · Mathematics 2013-06-20 Steven G. Krantz

The categorical models of the differential lambda-calculus are additive categories because of the Leibniz rule which requires the summation of two expressions. This means that, as far as the differential lambda-calculus and differential…

Logic in Computer Science · Computer Science 2021-11-30 Thomas Ehrhard

A result of Barnea and Isaacs states that if $L$ is a finite dimensional nilpotent Lie algebra with exactly two distinct centralizer dimensions, then nilpotency class of $L$ is either $2$ or $3$. In this article, we classify all such finite…

Rings and Algebras · Mathematics 2024-04-04 Rijubrata Kundu , Tushar Kanta Naik , Anupam Singh

Several general properties, concerning reduction algebras - rings of definition and algorithmic efficiency of the set of ordering relations - are discussed. For the reduction algebras, related to the diagonal embedding of the Lie algebra…

Representation Theory · Mathematics 2009-12-22 Sergey Khoroshkin , Oleg Ogievetsky

We express the Segre class of a monomial scheme in projective space in terms of log canonical thresholds of associated ideals. Explicit instances of the relation amount to identities involving the classical polygamma functions.

Algebraic Geometry · Mathematics 2018-01-25 Paolo Aluffi

Learning Spaces are certain set systems that are applied in the mathematical modeling of education. We propose a suitable compression (without loss of information) of such set systems to facilitate their logical and statistical analysis.…

Data Structures and Algorithms · Computer Science 2017-08-14 Marcel Wild

We study the correlation functions of logarithmic conformal field theories. First, assuming conformal invariance, we explicitly calculate two-- and three-- point functions. This calculation is done for the general case of more than one…

High Energy Physics - Theory · Physics 2015-06-26 M. R. Rahimi Tabar , A. Aghamohammadi , M. Khorrami

Linear differential equations and recurrences reveal many properties about their solutions. Therefore, these equations are well-suited for representing solutions and computing with special functions. We identify a large class of existing…

Symbolic Computation · Computer Science 2026-01-14 Louis Gaillard

We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…

Rings and Algebras · Mathematics 2023-09-18 Snehinh Sen

We introduce syntactic restrictions of the lexicographic path ordering to obtain the Light Lexicographic Path Ordering. We show that the light lexicographic path ordering leads to a characterisation of the functions computable in space…

Programming Languages · Computer Science 2007-05-23 E. A. Cichon , J-Y. Marion