- Start:
- Jan. 1, 2024
- Project leader:
- Andreas Reinhart
- FWF project number:
- PAT9756623
Participants
Researcher
- E-Mail:
- andreas.reinhart@uni-graz.at
- Phone:
- +43 (0)316 380 - 5074
- Office:
- Heinrichstraße 36, Room 528 (4th floor)
- Homepage:
- http://imsc.uni-graz.at/reinhart
Postdoc
- E-Mail:
- alessio.moscariello@uni-graz.at
- Office:
- Heinrichstraße 36, Room 528 (4th floor)
- Homepage:
- https://sites.google.com/view/alemoscariello/home
All participants are located at the
University of Graz
Heinrichstraße 36
8010 Graz
Austria
International Collaborators
Researcher
- E-Mail:
- laura.cossu3@unica.it
- Affiliation:
- Università degli Studi di Cagliari
- Homepage:
- https://web.unica.it/unica/page/it/laura_cossu3
Postdoc
- E-Mail:
- fgotti@mit.edu
- Affiliation:
- Massachusetts Institute of Technology
- Homepage:
- https://math.mit.edu/~fgotti/
Professor
- E-Mail:
- olberdin@nmsu.edu
- Affiliation:
- New Mexico State University
- Homepage:
- https://math.nmsu.edu/people/facultydirectory/bruce-olberding.html
Associate Professor
- E-Mail:
- salvo.tringali@gmail.com
- Affiliation:
- Hebei Normal University
- Homepage:
- https://imsc.uni-graz.at/tringali/
Project summary
A number of problems in various areas of mathematics, commonly known as factorization problems, revolve around the feasibility or impossibility of decomposing specific objects (referred to as elements by mathematicians) into others that are simpler and, in a sense, cannot be further broken down into smaller pieces. These simpler objects are typically called "irreducibles" and serve as the fundamental components of factorizations (another term for decompositions).
Let us consider a familiar example: positive integers. In this case, prime numbers are the irreducible components. Prime numbers are those integers that cannot be divided into smaller positive integers greater than one, and every positive integer can be expressed as a product of prime numbers. Similarly, polynomials with integer, real, or complex coefficients can be factored into irreducible polynomials.
Positive integers have a unique factorization into prime numbers, but for many other algebraic objects, there are numerous ways to break them down into irreducible building blocks. Factorization theory studies the existence and non-uniqueness (however defined) of factorizations of algebraic objects into irreducible ones. The objective is to describe all the distinct factorizations of a fixed element, using suitable algebraic parameters such as sets of (factorization) lengths. If an element $x$ is a product of $n$ irreducibles, then $n$ is a factorization length of $x$. The study of factorizations of given objects, in fact, provides a better understanding of their nature and structure.
The project "A broad theory of factorization: from matrices to ideals" investigates algebraic structures, including rings of matrices and monoids of ideals, from the perspective of factorization theory. These structures have not been explored from this viewpoint before, and the new approach will shed fresh light on long-standing open problems. Additionally, it will lead to a significant extension of current methods for investigating non-unique factorizations in rings and monoids, offering diverse and innovative applications.
Publications
-
Some applications of a new approach to factorization.
Recent Progress in Ring and Factorization Theory, Springer Proceedings in Mathematics & Statistics, 477 (2025), to appear. -
Realization of spaces of commutative rings.
J. London Math. Soc., 111: e70175 (2025). -
The category of atomic monoids: universal constructions and arithmetic properties.
submitted. -
On the arithmetic of power monoids.
submitted. -
An upper bound for the multiplicity and Wilf's conjecture for one-dimensional Cohen-Macaulay rings.
submitted. -
There is no polynomial formula for the catenary and the tame degree of finitely generated monoids.
submitted. -
Groups and the Bienvenu-Geroldinger Conjecture.
submitted.