Related papers: An Algebraic Perspective of Group Relaxations
This is a survey article devoted to the study of real structures on complex algebraic varieties endowed with a reductive group action.
We describe several technical tools that prove to be efficient for investigating the rewrite systems associated with a family of algebraic laws, and might be useful for more general rewrite systems. These tools consist in introducing a…
This thesis presents two descriptions of complexity in dynamical systems. The algebraic approach deals with the differential Galois group theory and its restrictions on integrability. The geometric part is a formulation of dynamics in the…
We report on recent progress concerning the relationship that exists between the algebraic structure of a finite group and certain features of its class-size prime graph.
In this book, the authors define several new types of soft neutrosophic algebraic structures over neutrosophic algebraic structures and we study their generalizations. These soft neutrosophic algebraic structures are basically parameterized…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
These lecture notes provide an introduction to logarithmic geometry with a view towards recent applications in the desingularization theory.
The paper bridges two vast areas of research: stochastic team decision problems and convex stochastic programming. New methods developed in the latter are applied to the study of fundamental problems in the former. The main results are…
In this talk we introduce several topics in combinatorial number theory which are related to groups; the topics include combinatorial aspects of covers of groups by cosets, and also restricted sumsets and zero-sum problems on abelian…
It is shown that the renormalization group (RG) method for global analysis can be formulated in the context of the classical theory of envelopes: Several examples from partial differential equations are analyzed. The amplitude equations…
We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non algebraic structure, such as topological assumptions. We provide algebraic axioms of revealed preference that subsume previous, classical…
In this paper we discuss the notion of smoothness in complex algebraic supergeometry and we prove that all affine complex algebraic supergroups are smooth. We then prove the stabilizer theorem in the algebraic context, providing some useful…
Primarily this paper presents an expository report on alternatives to the traditional methods of classifying representations of finite dimensional algebras. Some new results illustrating such alternatives for algebras with only finitely…
This is a proposal of an algebra which aims at distributed array processing. The focus lies on re-arranging and distributing array data, which may be multi-dimensional. The context of the work is scientific processing; thus, the core…
These notes are an exposition of Galois Theory from the original Lagrangian and Galoisian point of view. A particular effort was made here to better understand the connection between Lagrange's purely combinatorial approach and Galois…
Algebraic effects are computational effects that can be represented by an equational theory whose operations produce the effects at hand. The free model of this theory induces the expected computational monad for the corresponding effect.…
In this paper, a survey about recent progress on problems solved using graph amalgamations is presented, along with some new results with complete proofs, and some related open problems.
We study several different notions of algebraicity in use in stable homotopy theory and prove implications between them. The relationships between the different meanings of algebraic are unexpectedly subtle, and we illustrate this with…
We describe those group algebras over fields of characteristic different from 2 whose units symmetric with respect to the classical involution, satisfy some group identity.
We argue that computation is an abstract algebraic concept, and a computer is a result of a morphism (a structure preserving map) from a finite universal semigroup.