English
Related papers

Related papers: Some derivations among Logarithmic Space Bounded C…

200 papers

In this note, we will prove that a finite dimensional Lie algebra $L$ of characteristic zero, admitting an abelian algebra of derivations $D\leq Der(L)$ with the property $$ L^n\subseteq \sum_{d\in D}d(L) $$ for some $n\geq 1$, is…

Representation Theory · Mathematics 2010-11-09 Mohammad Shahryari

It is known that the category of Lie algebras over a ring admits algebraic exponents. The aim of this paper is to show that the same is true for the category of internal Lie algebras in an additive, cocomplete, symmetric, closed, monoidal…

Category Theory · Mathematics 2020-06-15 Xabier García-Martínez , James R. A. Gray

Recent breakthrough methods \cite{gggz,joux,bgjt} on computing discrete logarithms in small characteristic finite fields share an interesting feature in common with the earlier medium prime function field sieve method \cite{jl}. To solve…

Computational Complexity · Computer Science 2014-02-27 Ming-Deh Huang , Anand Kumar Narayanan

We describe an approach to logarithmic conformal field theories as limits of sequences of ordinary conformal field theories with varying central charge c. Logarithmic behaviour arises from degeneracies in the spectrum of scaling dimensions…

Statistical Mechanics · Physics 2013-11-25 John Cardy

We establish bounds on a finite separable extension of function fields in terms of the relative class number, thus reducing the problem of classifying extensions with a fixed relative class number to a finite computation. We also solve the…

In this paper we show some multiplicity estimates theorems for a connected algebraic group (not necessarily commutative) $G$ over an algebraically closed subfield of $\mathbb{C}$. More specifically, under particular assumptions on the…

Algebraic Geometry · Mathematics 2015-12-15 Mario Huicochea

It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.

Computational Complexity · Computer Science 2007-05-23 Tetsushi Matsui

We consider logarithmic conformal field theories near a boundary and derive the general form of one and two point functions. We obtain results for arbitrary and two dimensions. Application to two dimensional magnetohydrodynamics is…

High Energy Physics - Theory · Physics 2007-05-23 S. Moghimi-Araghi , S. Rouhani

We describe subalgebras of the Lie algebra $\mf{gl}(n^2)$ that contain all inner derivations of $A=M_n(F)$ (where $n\ge 5$ and $F$ is an algebraically closed field of characteristic 0). In a more general context where $A$ is a prime algebra…

Rings and Algebras · Mathematics 2012-04-25 M. Brešar , Š. Špenko

We formalize the proof of Reingold's Theorem that SL=L [Rei05] in the theory of bounded arithmetic VL, which corresponds to ``logspace reasoning''. As a consequence, we get that VL=VSL, where VSL is the theory of bounded arithmetic for…

Logic in Computer Science · Computer Science 2025-11-18 Sam Buss , Anant Dhayal , Valentine Kabanets , Antonina Kolokolova , Sasank Mouli

Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…

Logic · Mathematics 2023-03-07 Mariana Floricica Calin , Cristina Flaut , Dana Piciu

Polynomial closure is a standard operator which is applied to a class of regular languages. In the paper, we investigate three restrictions called left (LPol), right (RPol) and mixed polynomial closure (MPol). The first two were known while…

Formal Languages and Automata Theory · Computer Science 2023-01-03 Thomas Place

A language is said to be in catalytic logspace if we can test membership using a deterministic logspace machine that has an additional read/write tape filled with arbitrary data whose contents have to be restored to their original value at…

Computational Complexity · Computer Science 2026-02-09 V. Arvind , Srijan Chakraborty , Samir Datta

This paper talk about that NP is not AL and P, P is not NC, NC is not NL, and NL is not L. The point about this paper is the depend relation of the problem that need other problem's result to compute it. I show the structure of depend…

Computational Complexity · Computer Science 2011-11-22 Koji Kobayashi

The study of Locally Checkable Labelings (LCLs) has led to a remarkably precise characterization of the distributed time complexities that can occur on bounded-degree trees. A central feature of this complexity landscape is the existence of…

Distributed, Parallel, and Cluster Computing · Computer Science 2026-02-17 Gustav Schmid

We investigate the definability (reducts) lattice of the order of integers and describe a sublattice generated by relations 'between', 'cycle', 'separation', 'neighbor', '1-codirection', 'order' and equality'. Some open questions are…

Logic · Mathematics 2024-11-28 A. L. Semenov , S. F. Soprunov

Let L be a restricted Lie algebra over a field of positive characteristic. We survey the known results about the Lie structure of the restricted enveloping algebra u(L) of L. Related results about the structure of the group of units and the…

Rings and Algebras · Mathematics 2015-11-02 Salvatore Siciliano , Hamid Usefi

We explicitly describe the Lie algebras $M_L$ of ladder matrices in $M_n$ associate with dominant upper triangular ladders $L$, and completely characterize the derivations of these $M_L$ over a field $F$ with $char(F) \neq 2$. We also…

Rings and Algebras · Mathematics 2015-11-30 Prakash Ghimire , Huajun Huang

Let G be a finite group. The Plesken Lie algebra L[G] is a subalgebra of the complex group algebra C[G] and admits a direct-sum decomposition into simple Lie algebras based on the ordinary character theory of G. In this paper we review the…

Representation Theory · Mathematics 2024-06-21 John Cullinan

We classify a class of infinite-dimensional simple graded pre-Lie algebras on the graded vector space underlying the algebra of Laurent polynomials, with a specific form for the product.

Rings and Algebras · Mathematics 2007-05-23 Frederic Chapoton