English
Related papers

Related papers: Disjoint-union partial algebras

200 papers

In algebra, atomicity is the study of divisibility by and factorizations into atoms (also called irreducibles). In one side of the spectrum of atomicity we find the antimatter algebraic structures, inside which there are no atoms and,…

Commutative Algebra · Mathematics 2024-06-05 Jim Coykendall , Felix Gotti

Using the well-known equivalence between meet-completions of posets and standard closure operators we show a general method for constructing meet-completions for isotone poset expansions. With this method we find a meet-completion for…

Rings and Algebras · Mathematics 2015-02-24 Rob Egrot , Robin Hirsch

Binary idempotent semirings govern classical path algebras. Their multiplicative structure is dyadic. We examine whether this restriction is structural or accidental. We define ternary idempotent $\Gamma$-semirings as higher-arity ordered…

Rings and Algebras · Mathematics 2026-02-26 Chandrasekhar Gokavarapu , D. Madhusudhana Rao

Absolute algebras are a new type of algebraic structures, endowed with a meaningful notion of infinite sums of operations without supposing any underlying topology. Opposite to the usual definition of operadic calculus, they are defined as…

Algebraic Topology · Mathematics 2025-05-08 Victor Roca i Lucio

A family of partial functions of a class of algebras $\mathsf{K}$ is said to be an implicit operation of $\mathsf{K}$ when it is defined by a first order formula and it is preserved by homomorphisms. In this work, we develop the theory of…

Rings and Algebras · Mathematics 2026-04-24 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

We consider the permutation group algebra defined by Cameron and show that if the permutation group has no finite orbits, then no homogeneous element of degree one is a zero-divisor of the algebra. We proceed to make a conjecture which…

Combinatorics · Mathematics 2007-05-23 Julian D. Gilbey

Certain operator algebras A on a Hilbert space have the property that every densely defined linear transformation commuting with A is closable. Such algebras are said to have the closability property. They are important in the study of the…

Functional Analysis · Mathematics 2009-08-10 H. Bercovici , R. G. Douglas , C. Foias , C. Pearcy

The bipartition polynomial of a graph is a generalization of many other graph polynomials, including the domination, Ising, matching, independence, cut, and Euler polynomial. We show in this paper that it is also a powerful tool for proving…

Combinatorics · Mathematics 2017-02-14 Seongmin Ok , Peter Tittmann

We prove the existence of a transcendental entire function whose Julia set is a "bouquet of pseudo-arcs". More precisely, the union of the Julia set with infinity is an uncountable union of pseudo-arcs, which are pairwise disjoint except at…

Dynamical Systems · Mathematics 2021-05-24 Tania Gricel Benitez , Lasse Rempe

We initiate the study of a quantitative measure for the failure of a binary operation to be commutative and associative. We call this measure the associative-commutative spectrum as it extends the so-called associative spectrum (also known…

Combinatorics · Mathematics 2024-12-02 Jia Huang , Erkko Lehtonen

Partial connections are (singular) differential systems generalizing classical connections on principal bundles, yielding analogous decompositions for manifolds with nonfree group actions. Connection forms are interpreted as maps…

Differential Geometry · Mathematics 2007-05-23 Debra Lewis , Nilima Nigam , Peter Olver

We present some general theorems about operator algebras that are algebras of functions on sets, including theories of local algebras, residually finite dimensional operator algebras and algebras that can be represented as the scalar…

Operator Algebras · Mathematics 2009-07-30 Meghna Mittal , Vern Paulsen

We present a new method of analysis of associative algebras. This method bears a certain resemblance to the famous analysis of commutative $C^*$-algebras in which an important role is played by multiplicative functionals over the algebra.…

Rings and Algebras · Mathematics 2007-05-23 Vladimir Dergachev

In this paper, we first introduce associative-Yamaguti algebras as the associative analogue of Lie-Yamaguti algebras. Associative algebras, reductive associative algebras and associative triple systems of the first kind form subclasses of…

Rings and Algebras · Mathematics 2025-09-05 Apurba Das

We classify essential algebras whose irredundant non-refinable covers consist of primal algebras. The proof is obtained by constructing one to one correspondence between such algebras and partial orders on finite sets. Further, we prove…

Logic · Mathematics 2014-06-26 Shohei Izawa

An implicit operation of a class of similar algebras $\mathsf{K}$ is a collection of first order definable partial functions on the members of $\mathsf{K}$ that is globally preserved by homomorphisms. For instance, "taking inverses" can be…

Rings and Algebras · Mathematics 2026-03-17 Luca Carai , Miriam Kurtzhals , Tommaso Moraschini

There is a commutative algebra of differential-difference operators, with two parameters, associated to any dihedral group with an even number of reflections. The intertwining operator relates this algebra to the algebra of partial…

Classical Analysis and ODEs · Mathematics 2008-04-24 Charles F. Dunkl

In this note we answer to a frequently asked question. If G is an algebraic group acting on a variety V, a G-sheet of V is an irreducible component of V^(m), the set of elements of V whose G-orbit has dimension m. We focus on the case of…

Representation Theory · Mathematics 2010-11-24 Michael Bulois

We introduce two algebras associated with a subshift over an arbitrary alphabet. One is unital and the other not necessarily. We focus on the unital case and describe a conjugacy between Ott-Tomforde-Willis subshifts in terms of a…

Rings and Algebras · Mathematics 2023-12-04 Giuliano Boava , Gilles G. de Castro , Daniel Gonçalves , Daniel W. van Wyk

Type isomorphism is useful for retrieving library components, since a function in a library can have a type different from, but isomorphic to, the one expected by the user. Moreover type isomorphism gives for free the coercion required to…

Logic in Computer Science · Computer Science 2015-03-18 Mario Coppo , Mariangiola Dezani-Ciancaglini , Ines Margaria , Maddalena Zacchi