Iskalni niz:
išči po
išči po
išči po
išči po
Vrsta gradiva:
Jezik:
Št. zadetkov: 5
Monoid algebras and graph products
Wilfried Imrich, Igor Klep, Daniel Smertnig
Izvirni znanstveni članek
Oznake: graph products;monoid algebras;power series rings;uniqueness of roots;cancellation property;
In this note, we extend results about unique ▫$n^{\rm th}$▫ roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified lexicographic product. We show that these results also hold for gr ...
Leto: 2025 Vir: Repozitorij Univerze v Ljubljani (RUL)
Bergman's centralizer theorem
Jakob Jurij Snoj, Daniel Smertnig
Magistrsko delo
Oznake: Bergman centralizer theorem;free associative algebra;centralizer;
Bergman's centralizer theorem is a theorem describing the structure of a centralizer of a non-scalar element in a free associative algebra over a field. The thesis aims to present a reasonably self-contained proof of this result, following both the original proof by G. M. Bergman and a slightly diff ...
Leto: 2025 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Monoid algebras and graph products
Wilfried Imrich, Igor Klep, Daniel Smertnig
Izvirni znanstveni članek
Oznake: graph products;monoid algebras;power series rings;uniqueness of roots;cancellation property;
In this note, we extend results about unique n^th roots and cancellation of finite disconnected graphs with respect to the Cartesian, the strong and the direct product, to the rooted hierarchical products, and to a modified lexicographic product. We show that these results also hold for graphs with ...
Leto: 2025 Vir: Repozitorij Univerze na Primorskem (RUP)
Pumping-like results for copyless cost register automata and polynomially ambiguous weighted automata
Filip Mazowiecki, Antoni Puch, Daniel Smertnig
Objavljeni znanstveni prispevek na konferenci
Oznake: končni avtomati;linearna rekurzivna zaporedja;weighted automata;cost register automata;ambiguity;linear recurrence sequences;equivalence problem;
In this work we consider two rich subclasses of weighted automata over fields: polynomially ambiguous weighted automata and copyless cost register automata. Primarily we are interested in understanding their expressiveness power. Over the field of rationals and 1-letter alphabets, it is known that t ...
Leto: 2026 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Primes and absolutely or non-absolutely irreducible elements in atomic domains
Victor Fadinger, Sophie Frisch, Sarah Nakato, Daniel Smertnig, Daniel Windisch
Izvirni znanstveni članek
Oznake: absolutely irreducible elements;non-absolutely irreducible elements;non-unique factorization;integer-valued polynomials;irreducible elements;transfer homomorphisms;zero-sum sequences;
We give examples of atomic integral domains satisfying each of the eight logically possible combinations of existence or nonexistence of the following kinds of elements: (1) primes, (2) absolutely irreducible elements that are not prime, and (3) irreducible elements that are not absolutely irreducib ...
Leto: 2026 Vir: Fakulteta za matematiko in fiziko (UL FMF)
Št. zadetkov: 5
Ključne besede:
Leto izdaje:
Avtorji:
Repozitorij:
Tipologija:
Jezik: