English
Related papers

Related papers: Some derivations among Logarithmic Space Bounded C…

200 papers

We study mappings satisfying some estimate of distortion of modulus of families of paths. Under some conditions on definition and mapped domains, we have proved that these mappings are logarithmic H\"{o}lder continuous at boundary points.

Complex Variables · Mathematics 2023-04-04 Oleksandr Dovhopiatyi , Evgeny Sevost'yanov

In this paper we provide purely model-theoretic (algebraic) characterisations for classes definable in second-order logic and for pseudo-elementary classes (including PC and PC_{\Delta} classes). Classical results of this flavour include…

Logic · Mathematics 2026-05-12 János Balázs Ivanyos

In recent years, the notion of characteristic polynomial of representations of Lie algebras has been widely studied. This paper provides more properties of these characteristic polynomials. For simple Lie algebras, we characterize the…

Representation Theory · Mathematics 2023-08-10 Korkeat Korkeathikhun , Borworn Khuhirun , Songpon Sriwongsa , Keng Wiboonton

We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…

Logic · Mathematics 2021-03-10 Nathanael Ackerman , Cameron Freer , Rehana Patel

We show that there are infinitely many distinct closed classes of colimits (in the sense of the Galois connection induced by commutation of limits and colimits in Set) which are intermediate between the class of pseudo-filtered colimits and…

Category Theory · Mathematics 2015-05-06 Marie Bjerrum , Peter Johnstone , Tom Leinster , William F. Sawin

We analyse the complexity of solving the discrete logarithm problem and of testing the principality of ideals in a certain class of number fields. We achieve the subexponential complexity in $O(L(1/3,O(1)))$ when both the discriminant and…

Number Theory · Mathematics 2012-04-06 Jean-François Biasse

We define the notion of characteristic classes for supermanifolds endowed with a homological vector field $Q$. These take values in the cohomology of the Lie derivative operator $L_Q$ acting on arbitrary tensor fields. We formulate a…

Quantum Algebra · Mathematics 2007-05-23 S. L. Lyakhovich , E. A. Mosman , A. A. Sharapov

The discreteness problem for finitely generated subgroups of $PSL(2,\mathbb{R})$ and $PSL(2,\mathbb{C})$ is a long-standing open problem. In this paper we consider whether or not this problem is decidable by an algorithm. Our main result is…

Group Theory · Mathematics 2022-06-14 Jane Gilman

Recently, Andrews introduced separable integer partition classes and studied some well-known theorems. In this article, we will consider the types of partitions with restrictions on consecutive parts. We will show that such partitions are…

Combinatorics · Mathematics 2025-10-03 Y. Q. Chen , Thomas Y. He , X. M. Huang , T. T. Zou

In this work, we explore proof theoretical connections between sequent, nested and labelled calculi. In particular, we show a general algorithm for transforming a class of nested systems into sequent calculus systems, passing through linear…

Logic in Computer Science · Computer Science 2018-02-15 Elaine Pimentel

We identify fragments of the arithmetic $S_1$ that enjoy nice closure properties and have exact characterization of their definable multifunctions. To do this, in the language of $S_1$, $L_1$, starting from the formula classes,…

Logic in Computer Science · Computer Science 2025-08-20 Chris Pollett

The discrete logarithm problem is a fundamental challenge in number theory with significant implications for cryptographic protocols. In this paper, we investigate the limitations of gradient-based methods for learning the parity bit of the…

Machine Learning · Computer Science 2023-10-04 Rustem Takhanov , Maxat Tezekbayev , Artur Pak , Arman Bolatov , Zhibek Kadyrsizova , Zhenisbek Assylbekov

Computability on uncountable sets has no standard formalization, unlike that on countable sets, which is given by Turing machines. Some of the approaches to define computability in these sets rely on order-theoretic structures to translate…

Logic · Mathematics 2024-11-20 Pedro Hack , Daniel A. Braun , Sebastian Gottwald

Closed form expressions for a multivector exponential and logarithm are presented in real Clifford geometric algebras Cl(p,q)when n=p+q=1 (complex and hyperbolic numbers) and n=2 (Hamilton, split and conectorine quaternions). Starting from…

Mathematical Physics · Physics 2022-04-12 Adolfas Dargys , Arturas Acus

In the standard model of computing multi-output functions in logspace ($\mathsf{FL}$), we are given a read-only tape holding $x$ and a logarithmic length worktape, and must print $f(x)$ to a dedicated write-only tape. However, there has…

Computational Complexity · Computer Science 2025-10-15 James Cook , Surendra Ghentiyala , Ian Mertz , Edward Pyne , Nathan S. Sheffield

For deep ordinal classification, learning a well-structured feature space specific to ordinal classification is helpful to properly capture the ordinal nature among classes. Intuitively, when Euclidean distance metric is used, an ideal…

Computer Vision and Pattern Recognition · Computer Science 2023-08-29 Cong Wang , Zhiwei Jiang , Yafeng Yin , Zifeng Cheng , Shiping Ge , Qing Gu

Motivated by the recent progress towards classification of simple finite-dimensional Lie algebras over an algebraically closed field of characteristic $2$, we investigate such $15$-dimensional algebras.

Rings and Algebras · Mathematics 2021-04-06 Alexander Grishkov , Henrique Guzzo , Marina Rasskazova , Pasha Zusmanovich

We consider and characterize classes of finite and countably categorical structures and their theories preserved under $E$-operators and $P$-operators. We describe $e$-spectra and families of finite cardinalities for structures belonging to…

Logic · Mathematics 2017-01-04 Sergey V. Sudoplatov

Restricted Lie algebras of dimension up to $3$ over algebraically closed fields of positive characteristic were classified by Wang and his collaborators in [25, 19]. In this paper, we obtain a classification of restricted Lie algebras of…

Rings and Algebras · Mathematics 2025-06-19 W. Liu , G. -S. Zhou

We prove that the height of any algebraic computation tree for deciding membership in a semialgebraic set is bounded from below (up to a multiplicative constant) by the logarithm of m-th Betti number (with respect to singular homology) of…

Computational Complexity · Computer Science 2015-08-18 Nicolai Vorobjov , Andrei Gabrielov
‹ Prev 1 8 9 10 Next ›