Results 51 to 60 of about 46,949 (225)

Eulerian idempotent, pre-Lie logarithm and combinatorics of trees [PDF]

open access: yes, 2017
The aim of this paper is to bring together the three objects in the title. Recall that, given a Lie algebra $\mathfrak{g}$, the Eulerian idempotent is a canonical projection from the enveloping algebra $U(\mathfrak{g})$ to $\mathfrak{g}$.
Bandiera, Ruggero, Schaetz, Florian
core   +1 more source

A classification of Prüfer domains of integer‐valued polynomials on algebras

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.
Abstract Let D$D$ be an integrally closed domain with quotient field K$K$ and A$A$ a torsion‐free D$D$‐algebra that is finitely generated as a D$D$‐module and such that A∩K=D$A\cap K=D$. We give a complete classification of those D$D$ and A$A$ for which the ring IntK(A)={f∈K[X]∣f(A)⊆A}$\textnormal {Int}_K(A)=\lbrace f\in K[X] \mid f(A)\subseteq A ...
Giulio Peruginelli, Nicholas J. Werner
wiley   +1 more source

All Regular-Solid Varieties of Idempotent Semirings

open access: yesDiscussiones Mathematicae - General Algebra and Applications, 2017
The lattice of all regular-solid varieties of semirings splits in two complete sublattices: the sublattice of all idempotent regular-solid varieties of semirings and the sublattice of all normal regular-solid varieties of semirings.
Hounnon Hippolyte
doaj   +1 more source

Ideals of Projections According to σ-Algebras and Unbounded Measurements

open access: yesAxioms, 2023
A theory of unbounded measures is constructed based on the quantum logics of orthogonal projections. As an analogue of the ring of sets, the projector ideal is proposed. Finite and maximal measures regarding the projector ideals are described.
Marjan Matvejchuk
doaj   +1 more source

Idempotents et échantillonnage parcimonieux [PDF]

open access: yesComptes Rendus. Mathématique, 2011
Comment reconstituer un signal, assimilé à une fonction x définie sur le groupe cyclique ZN, quʼon sait porté par T points, en nʼutilisant sa transformée de Fourier xˆ que sur un ensemble Ω de fréquences ? Le procédé indiqué par Candès (2006) [1], Candès, Romberg et Tao (2006) [2] est lʼextrapolation minimale de xˆ|Ω dans Fℓ1.
openaire   +2 more sources

The ∞$\infty$‐categorical reflection theorem and applications

open access: yesJournal of Topology, Volume 19, Issue 1, March 2026.
Abstract We prove an ∞$\infty$‐categorical version of the reflection theorem of AdÁmek and Rosický [Arch. Math. 25 (1989), no. 1, 89–94]. Namely, that a full subcategory of a presentable ∞$\infty$‐category that is closed under limits and κ$\kappa$‐filtered colimits is a presentable ∞$\infty$‐category.
Shaul Ragimov, Tomer M. Schlank
wiley   +1 more source

Combinatorics of the free Baxter algebra [PDF]

open access: yes, 2005
We study the free (associative, non-commutative) Baxter algebra on one generator. The first explicit description of this object is due to Ebrahimi-Fard and Guo.
Aguiar, Marcelo, Moreira, Walter
core   +9 more sources

On the Q‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 2, Page 69-86, February 2026.
ABSTRACT Let Γ denote a finite, connected graph with vertex set X. Fix x ∈ X and let ε ≥ 3 denote the eccentricity of x. For mutually distinct scalars { θ i * } i = 0 ε define a diagonal matrix A * = A * ( θ 0 * , θ 1 * , … , θ ε * ) ∈ Mat X ( R ) as follows: for y ∈ X we let ( A * ) y y = θ ∂ ( x , y ) *, where ∂ denotes the shortest path length ...
Blas Fernández   +3 more
wiley   +1 more source

THE BEST SOLUTION FOR INEQUALITIES OF A O CROSS X LOWER THAN X FROM B O DOT X USING HIGH MATRIX RESIDUATION OF IDEMPOTENT SEMIRING

open access: yesJurnal Sains Dasar, 2017
A complete idempotent semiring has a structure which is called a complete lattice. Because of the same structure as the complete lattice then inequality of the complete idempotent semiring can be solved a solution by using residuation theory.
Eka Susilowati, Ari Suparwanto
doaj  

Home - About - Disclaimer - Privacy