English
Related papers

Related papers: Decomposition of P{\l}onka sums into direct system…

200 papers

We show that the direct image of the filtered logarithmic de Rham complex is a direct sum of filtered logarithmic complexes with coefficients in variations of Hodge structures, using a generalization of the decomposition theorem of…

Algebraic Geometry · Mathematics 2007-05-23 Morihiko Saito

Closure system on a finite set is a unifying concept in logic programming, relational data bases and knowledge systems. It can also be presented in the terms of finite lattices, and the tools of economic description of a finite lattice have…

Combinatorics · Mathematics 2014-01-29 Kira Adaricheva , J. B. Nation , Robert Rand

An eikonal algebra ${\mathfrak E}(\Omega)$ is a C*-algebra related to a metric graph $\Omega$. It is determined by trajectories and reachable sets of a dynamical system associated with the graph. The system describes the waves, which are…

Mathematical Physics · Physics 2022-12-13 M. I. Belishev , A. V. Kaplun

We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…

Combinatorics · Mathematics 2015-07-07 Ilke Canakci , Ralf Schiffler

This paper presents a methodology for constructing iterative schemes of any order of convergence for solving nonlinear systems of equations. It also provides formulas for the order of convergence of any iterative schemes constructed using…

Numerical Analysis · Mathematics 2018-06-12 Stefan Hothazie , Munteanu Camelia Elena , Mihaela Nastase

Probabilistic Logic Programs (PLPs) generalize traditional logic programs and allow the encoding of models combining logical structure and uncertainty. In PLP, inference is performed by summarizing the possible worlds which entail the query…

Logic in Computer Science · Computer Science 2018-04-30 Arun Nampally , Timothy Zhang , C. R. Ramakrishnan

We introduce a non-wellfounded proof system for intuitionistic logic extended with inductive and co-inductive definitions, based on a syntax in which fixpoint formulas are annotated with explicit variables for ordinals. We explore the…

Logic in Computer Science · Computer Science 2026-05-13 Sebastian Enqvist

This paper explores relational syllogistic logics, a family of logical systems related to reasoning about relations in extensions of the classical syllogistic. These are all decidable logical systems. We prove completeness theorems and…

Logic · Mathematics 2023-06-22 Alex Kruckman , Lawrence S. Moss

We consider a family of infinite sums of products of Catalan numbers, indexed by trees. We show that these sums are polynomials in $1/\pi$ with rational coefficients; the proof is effective and provides an algorithm to explicitly compute…

Combinatorics · Mathematics 2025-08-01 Alin Bostan , Valentin Féray , Paul Thévenin

Let $G$ be a group and let $k$ be a field. Kaplansky's direct finiteness conjecture states that every one-sided unit of the group ring $k[G]$ must be a two-sided unit. In this paper, we establish a geometric direct finiteness theorem for…

Algebraic Geometry · Mathematics 2021-11-16 Xuan Kien Phung

In this short note we study the cohomology algebra of saturated fusion systems using finite groups which realize saturated fusion systems and Hochschild cohomology of group algebras. A similar result to a theorem of Alperin is proved for…

Group Theory · Mathematics 2016-10-05 Constantin-Cosmin Todea

We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…

Rings and Algebras · Mathematics 2020-11-23 Peter A. Brooksbank , Joshua Maglione , James B. Wilson

We study the decomposition of multivariate polynomials as sums of powers of linear forms. As one of our main results we give an algorithm for the following problem: given a homogeneous polynomial of degree 3, decide whether it can be…

Computational Complexity · Computer Science 2021-07-15 Pascal Koiran , Mateusz Skomra

This is a survey on formality results relying on weight structures. A weight structure is a naturally occurring grading on certain differential graded algebras. If this weight satisfies a purity property, one can deduce formality. Algebraic…

Algebraic Topology · Mathematics 2024-06-28 Coline Emprin , Geoffroy Horel

First of all, we recall the well known notion of semidirect product both for classical algebraic structures (like groups and rings) and for more recent ones (digroups, left skew braces, heaps, trusses). Then we analyse the concept of…

Rings and Algebras · Mathematics 2023-11-09 Alberto Facchini , David Stanovský

We introduce the class of graded Lie-Rinehart algebras as a natural generalization of the one of graded Lie algebras. For $G$ an abelian group, we show that if $L$ is a tight $G$-graded Lie-Rinehart algebra over an associative and…

Rings and Algebras · Mathematics 2023-08-09 Elisabete Barreiro , Antonio J. Calderón , Rosa M. Navarro , José M. Sánchez

In this paper, we firstly construct an $L_\infty[1]$-algebra via the method of higher derived brackets, whose Maurer-Cartan elements correspond to relative $\Omega$-family Rota-Baxter algebras structures of weight $\lambda$. For a relative…

Rings and Algebras · Mathematics 2023-04-11 Chao Song , Kai Wang , Yuanyuan Zhang

This paper introduces a categorification of $k$-algebras called 2 -algebras, where k is a commutative ring. We define the 2-algebras as a 2-category with single object in which collections of all 1-morphisms and all 2-morphisms are…

Category Theory · Mathematics 2016-04-21 İbrahim İlker Akça , Ummahan Ege Arslan

We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…

Logic · Mathematics 2024-02-14 Endre Tóth , Tamás Waldhauser

We describe and prove correctness of two practical algorithms for finding indecomposable summands of finitely generated modules over a finitely generated k-algebra R. The first algorithm applies in the (multi)graded case, which enables the…

Commutative Algebra · Mathematics 2026-05-28 Devlin Mallory , Mahrud Sayrafi
‹ Prev 1 8 9 10 Next ›