Related papers: Algebraic Complexity Classes
We introduce a new notion of complexity of functions and we show that it has the following properties: (i) it governs a PAC Bayes-like generalization bound, (ii) for neural networks it relates to natural notions of complexity of functions…
Born from years of teaching undergraduate and graduate algebra courses at Chongqing University, this text is designed to introduce Galois theory while minimizing prerequisites. It seeks to reconnect the abstract machinery of modern algeba:…
We study possibilities for algebraic closures, differences between definable and algebraic closures in first-order structures, and variations of these closures with respect to the bounds of cardinalities of definable sets and given sets of…
We define a theory of parameterized algebraic complexity classes in analogy to parameterized Boolean counting classes. We define the classes VFPT and VW[t], which mirror the Boolean counting classes #FPT and #W[t], and define appropriate…
A network-theoretic approach for determining the complexity of a graph is proposed. This approach is based on the relationship between the linear algebra (theory of determinants) and the graph theory. In this paper we contribute a new…
We present a graded-geometric approach to modular classes of Lie algebroids and their generalizations, introducing in this setting an idea of relative modular class of a Dirac structure for a certain type of Courant algebroids, called…
The chapter provides an introduction to the basic concepts of Algebraic Topology with an emphasis on motivation from applications in the physical sciences. It finishes with a brief review of computational work in algebraic topology,…
A class of algebras called down-up algebras was introduced by G. Benkart and T. Roby. We classify the finite dimensional simple modules over Noetherian down-up algebras and show that in some cases every finite dimensional module is…
This survey reports on current progress of programs to classify graph C*-algebras and Leavitt path algebras up to Morita equivalence using K-theory. Beginning with an overview and some history, we trace the development of the classification…
We provide a self-contained introduction into Weihrauch complexity and its applications to computable analysis. This includes a survey on some classification results and a discussion of the relation to other approaches.
The analysis and quantification of sequence complexity is an open problem frequently encountered when defining trajectory prediction benchmarks. In order to enable a more informative assembly of a data basis, an approach for determining a…
The term complexity derives etymologically from the Latin plexus, which means interwoven. Intuitively, this implies that something complex is composed by elements that are difficult to separate. This difficulty arises from the relevant…
This is a short survey on the recent developments made in the integration theory with effective formulas of algebraic structures stronger or higher than Lie algebras.
The topics of Convexity and Concavity and Envelopes are central in Complex Analysis and extensively investigated. The aim of this paper is to find a possible counterpart in Algebraic Geometry. The article presents preliminary results on…
In this note we recall the classical notion of an algebraically rectifiable plane curve going back to J. A. Serret, E. Laguerre and G. Humbert. We provide new criteria of algebraic rectifiability, relate this notion to quadratic…
We introduce and investigate the concept of Stratified Algebra, a new algebraic framework equipped with a layer-based structure on a vector space. We formalize a set of axioms governing intra-layer and inter-layer interactions, study their…
We investigate the notion of complexity for finitely presented groups and the related notion of complexity for three-dimensional manifolds. We give two-sided estimates on the complexity of all the Milnor groups (the finite groups with free…
This is a revised version of the notes from the week-long course I gave at the Centre de Recerca Matematica, Barcelona, in September of 2010. The aim is to give a working overview of recent methods and results in "Blaschkean integral…
We start with elementary algebraic theory of factorization of linear ordinary differential equations developed in the period 1880-1930. After exposing these classical results we sketch more sophisticated algorithmic approaches developed in…
This paper is devoted to the classification and studying properties of complex unital $3$-dimensional structurable algebras. We provide a complete list of non-isomorphic classes, identifying five algebras for type $(2, 1)$ and two algebras…