Daniel Smertnig
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Daniel Smertnig has a total of 19 co-authors. Here are the top co-authors by number of shared publications:
- Jason P. Bell
University of Waterloo
6 shared publications - Nicholas R. Baeth
University of Central Missouri
6 shared publications - Alberto Facchini
Dipartimento di Matematica “Tullio Levi-Civita”, Università di Padova, Padova, Italy
1 shared publication - Alfred Geroldinger
Department of Mathematics and Scientific Computing, University of Graz, NAWI Graz, Heinrichstraße 36, 8010 Graz, Austria
1 shared publication - Boris Adamczewski
Univ Lyon Université Claude Bernard Lyon 1 CNRS UMR 5208 Institut Camille Jordan F-69622 Villeurbanne, France
1 shared publication Daniel Windisch
KU Leuven, Leuven (Heverlee)
1 shared publication
Latest Publications
- Open Access
- 8 January 2026
- Published by Taylor & Francis in Communications in Algebra
- Vol. 54 (6) , 2631-2648
Primes and absolutely or non-absolutely irreducible elements in atomic domains
- 8 January 2026
- Published by Taylor & Francis in Communications in Algebra
- Vol. 54 (6) , 2631-2648
Open AccessPrimes and absolutely or non-absolutely irreducible elements in atomic domains
- Open Access
- 3 September 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 386, 35-50
Duality of Lattices Associated to Left and Right Quotients
We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other. We also give necessary and sufficient conditions for these lattices to have maximal possible complexity.
- 3 September 2023
- Published by Open Publishing Association in Electronic Proceedings in Theoretical Computer Science
- Vol. 386, 35-50
Open AccessDuality of Lattices Associated to Left and Right Quotients
We associate lattices to the sets of unions and intersections of left and right quotients of a regular language. For both unions and intersections, we show that the lattices we produce using left and right quotients are dual to each other. We also give necessary and sufficient conditions for these lattices to have maximal possible complexity.
- Open Access
Computing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
The (left) linear hull of a weighted automaton over a field is a topological invariant. If the automaton is minimal, the linear hull can be used to determine whether or not the automaton is equivalent to a deterministic one. Furthermore, the linear hull can also be used to determine whether the minimal automaton is equivalent to an unambiguous one. We show how to compute the linear hull, and thus prove that it is decidable whether or not a given automaton over a number field is equivalent to a deterministic one. In this case we are also able to compute an equivalent deterministic automaton. We also show the analogous decidability and computability result for the unambiguous case. Our results resolve a problem posed in a 2006 survey by Lombardy and Sakarovitch.
Open AccessComputing the linear hull: Deciding Deterministic? and Unambiguous? for weighted automata over fields
The (left) linear hull of a weighted automaton over a field is a topological invariant. If the automaton is minimal, the linear hull can be used to determine whether or not the automaton is equivalent to a deterministic one. Furthermore, the linear hull can also be used to determine whether the minimal automaton is equivalent to an unambiguous one. We show how to compute the linear hull, and thus prove that it is decidable whether or not a given automaton over a number field is equivalent to a deterministic one. In this case we are also able to compute an equivalent deterministic automaton. We also show the analogous decidability and computability result for the unambiguous case. Our results resolve a problem posed in a 2006 survey by Lombardy and Sakarovitch.
- Open Access
- 6 February 2023
- Published by Elsevier in Journal of Algebra
- Vol. 622, 404-449
On noncommutative bounded factorization domains and prime rings
- 6 February 2023
- Published by Elsevier in Journal of Algebra
- Vol. 622, 404-449
Open AccessOn noncommutative bounded factorization domains and prime rings
- Open Access
On noncommutative bounded factorization domains and prime rings
A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most basic finiteness properties in the study of non-unique factorizations. Every commutative noetherian domain has bounded factorizations, but it is open whether such a result holds in the noncommutative setting. We provide sufficient conditions for a noncommutative noetherian prime ring to have bounded factorizations. Moreover, we construct a (noncommutative) finitely presented semigroup algebra that is an atomic domain but does not satisfy the ascending chain condition on principal right or left ideals (ACCP), whence it does not have bounded factorizations.Open AccessOn noncommutative bounded factorization domains and prime rings
A ring has bounded factorizations if every cancellative nonunit $a \in R$ can be written as a product of atoms and there is a bound $\lambda(a)$ on the lengths of such factorizations. The bounded factorization property is one of the most basic finiteness properties in the study of non-unique factorizations. Every commutative noetherian domain has bounded factorizations, but it is open whether such a result holds in the noncommutative setting. We provide sufficient conditions for a noncommutative noetherian prime ring to have bounded factorizations. Moreover, we construct a (noncommutative) finitely presented semigroup algebra that is an atomic domain but does not satisfy the ascending chain condition on principal right or left ideals (ACCP), whence it does not have bounded factorizations. - 3 October 2022
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 75 (6) , 1-35
D-finite multivariate series with arithmetic restrictions on their coefficients
- 3 October 2022
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 75 (6) , 1-35
D-finite multivariate series with arithmetic restrictions on their coefficients
- Open Access
$D$-finite multivariate series with arithmetic restrictions on their coefficients
A multivariate, formal power series over a field $K$ is a B\'ezivin series if all of its coefficients can be expressed as a sum of at most $r$ elements from a finitely generated subgroup $G \le K^*$; it is a P\'olya series if one can take $r=1$. We give explicit structural descriptions of $D$-finite B\'ezivin series and $D$-finite P\'olya series over fields of characteristic $0$, thus extending classical results of P\'olya and B\'ezivin to the multivariate setting.Open Access$D$-finite multivariate series with arithmetic restrictions on their coefficients
A multivariate, formal power series over a field $K$ is a B\'ezivin series if all of its coefficients can be expressed as a sum of at most $r$ elements from a finitely generated subgroup $G \le K^*$; it is a P\'olya series if one can take $r=1$. We give explicit structural descriptions of $D$-finite B\'ezivin series and $D$-finite P\'olya series over fields of characteristic $0$, thus extending classical results of P\'olya and B\'ezivin to the multivariate setting. - Open Access
A height gap theorem for coefficients of Mahler functions
We study the asymptotic growth of coefficients of Mahler power series with algebraic coefficients, as measured by their logarithmic Weil height. We show that there are five different growth behaviors, all of which being reached. Thus, there are \emph{gaps} in the possible growths. In proving this height gap theorem, we obtain that a $k$-Mahler function is $k$-regular if and only if its coefficients have height in $O(\log n)$. Furthermore, we deduce that, over an arbitrary ground field of characteristic zero, a $k$-Mahler function is $k$-automatic if and only if its coefficients belong to a finite set. As a by-product of our results, we also recover a conjecture of Becker which was recently settled by Bell, Chyzak, Coons, and Dumas.Open AccessA height gap theorem for coefficients of Mahler functions
We study the asymptotic growth of coefficients of Mahler power series with algebraic coefficients, as measured by their logarithmic Weil height. We show that there are five different growth behaviors, all of which being reached. Thus, there are \emph{gaps} in the possible growths. In proving this height gap theorem, we obtain that a $k$-Mahler function is $k$-regular if and only if its coefficients have height in $O(\log n)$. Furthermore, we deduce that, over an arbitrary ground field of characteristic zero, a $k$-Mahler function is $k$-automatic if and only if its coefficients belong to a finite set. As a by-product of our results, we also recover a conjecture of Becker which was recently settled by Bell, Chyzak, Coons, and Dumas. - Open Access
Lattices over Bass rings and graph agglomerations
We study direct-sum decompositions of torsion-free, finitely generated modules over a (commutative) Bass ring $R$ through the factorization theory of the corresponding monoid $T(R)$. Results of Levy-Wiegand and Levy-Odenthal together with a study of the local case yield an explicit description of $T(R)$. The monoid is typically neither factorial nor cancellative. Nevertheless, we construct a transfer homomorphism to a monoid of graph agglomerations--a natural class of monoids serving as combinatorial models for the factorization theory of $T(R)$. As a consequence, the monoid $T(R)$ is transfer Krull of finite type and several finiteness results on arithmetical invariants apply. We also establish results on the elasticity of $T(R)$ and characterize when $T(R)$ is half-factorial. (Factoriality, that is, torsion-free Krull-Remak-Schmidt-Azumaya, is characterized by a theorem of Levy-Odenthal.) The monoids of graph agglomerations introduced here are also of independent interest.Open AccessLattices over Bass rings and graph agglomerations
We study direct-sum decompositions of torsion-free, finitely generated modules over a (commutative) Bass ring $R$ through the factorization theory of the corresponding monoid $T(R)$. Results of Levy-Wiegand and Levy-Odenthal together with a study of the local case yield an explicit description of $T(R)$. The monoid is typically neither factorial nor cancellative. Nevertheless, we construct a transfer homomorphism to a monoid of graph agglomerations--a natural class of monoids serving as combinatorial models for the factorization theory of $T(R)$. As a consequence, the monoid $T(R)$ is transfer Krull of finite type and several finiteness results on arithmetical invariants apply. We also establish results on the elasticity of $T(R)$ and characterize when $T(R)$ is half-factorial. (Factoriality, that is, torsion-free Krull-Remak-Schmidt-Azumaya, is characterized by a theorem of Levy-Odenthal.) The monoids of graph agglomerations introduced here are also of independent interest. - Open Access
- 15 March 2021
- Published by Springer Nature in Algebras and Representation Theory
- Vol. 25 (3) , 669-704
Lattices over Bass Rings and Graph Agglomerations
We study direct-sum decompositions of torsion-free, finitely generated modules over a (commutative) Bass ring R through the factorization theory of the corresponding monoid T(R). Results of Levy–Wiegand and Levy–Odenthal together with a study of the local case yield an explicit description of T(R). The monoid is typically neither factorial nor cancellative. Nevertheless, we construct a transfer homomorphism to a monoid of graph agglomerations—a natural class of monoids serving as combinatorial models for the factorization theory of T(R). As a consequence, the monoid T(R) is transfer Krull of finite type and several finiteness results on arithmetical invariants apply. We also establish results on the elasticity of T(R) and characterize when T(R) is half-factorial. (Factoriality, that is, torsion-free Krull–Remak–Schmidt–Azumaya, is characterized by a theorem of Levy–Odenthal.) The monoids of graph agglomerations introduced here are also of independent interest.
- 15 March 2021
- Published by Springer Nature in Algebras and Representation Theory
- Vol. 25 (3) , 669-704
Open AccessLattices over Bass Rings and Graph Agglomerations
We study direct-sum decompositions of torsion-free, finitely generated modules over a (commutative) Bass ring R through the factorization theory of the corresponding monoid T(R). Results of Levy–Wiegand and Levy–Odenthal together with a study of the local case yield an explicit description of T(R). The monoid is typically neither factorial nor cancellative. Nevertheless, we construct a transfer homomorphism to a monoid of graph agglomerations—a natural class of monoids serving as combinatorial models for the factorization theory of T(R). As a consequence, the monoid T(R) is transfer Krull of finite type and several finiteness results on arithmetical invariants apply. We also establish results on the elasticity of T(R) and characterize when T(R) is half-factorial. (Factoriality, that is, torsion-free Krull–Remak–Schmidt–Azumaya, is characterized by a theorem of Levy–Odenthal.) The monoids of graph agglomerations introduced here are also of independent interest.