Related papers: A note on square-free factorizations

Let $S$ be an integral domain with field of fractions $F$ and let $A$ be an $F$-algebra having an $S$-stable basis. We prove the existence of an $S$-subalgebra $R$ of $A$ lying over $S$ whose localization with respect to $S$ is $A$ (we call…

Let $R=\Bbbk[x_1,\..., x_n]$ and $M=R^s/I$ a multigraded squarefree module. We discuss the construction of cochain complexes associated to $M$ and we show how to interpret homological invariants of $M$ in terms of topological computations.…

We present an improved construction of the fundamental matrix factorization in the FJRW-theory given in arXiv:1105.2903. The revised construction is coordinate-free and works for a possibly nonabelian finite group of symmetries. One of the…

We determine the density of integral binary forms of given degree that have squarefree discriminant, proving for the first time that the lower density is positive. Furthermore, we determine the density of integral binary forms that cut out…

We pose the question of what is the best generalization of the factorial and the binomial coefficient. We give several examples, derive their combinatorial properties, and demonstrate their interrelationships. On cherche ici \`a…

A subset $S$ of an integral domain $R$ is called a semidomain if the pairs $(S,+)$ and $(S, \cdot)$ are semigroups with identities; additionally, we say that $S$ is additively reduced provided that $S$ contains no additive inverses. Given…

We study the integral domains D satisfying the following condition: whenever I >AB with I,A,B nonzero ideals, there exist ideals A'>A and B'>B such that I=A'B'.

Locally acyclic cluster algebras are Krull domains. Hence their factorization theory is determined by their (divisor) class group and the set of classes containing height-1 prime ideals. Motivated by this, we investigate class groups of…

We study bounds for the Castelnuovo-Mumford regularity of homogeneous ideals in a polynomial ring in terms of the number of variables and the degree of the generators. In particular our aim is to give a positive answer to a question posed…

We show that any nonsingular (real or complex) square matrix can be factorized into a product of at most three normal matrices, one of which is unitary, another selfadjoint with eigenvalues in the open right half-plane, and the third one is…

For strongly Euler-homogeneous, Saito-holonomic, and tame analytic germs we consider general types of multivariate Bernstein-Sato ideals associated to arbitrary factorizations of our germ. We show the zero loci of these ideals are purely…

Two-dimensional squarefree monomial ideals can be seen as the Stanley-Reisner ideals of graphs. The main results of this paper are combinatorial characterizations for the Cohen-Macaulayness of ordinary and symbolic powers of such an ideal…

We generalize the differential dimension polynomial from prime differential ideals to characterizable differential ideals. Its computation is algorithmic, its degree and leading coefficient remain differential birational invariants, and it…

We study factorizations of operator valued functions of weighted Schur classes over multiply-connected domains. There is a correspondence between functions from weighted Schur classes and so-called ``conservative curved'' systems introduced…

We consider the Whitehead problem for principal ideal domains of large size. It is proved, in ZFC, that some p.i.d.'s of size >= aleph_{2} have non-free Whitehead modules even though they are not complete discrete valuation rings.

This paper studies the notions of star and semistar operations over a polynomial ring. It aims at characterizing when every upper to zero in $R[X]$ is a $*$-maximal ideal and when a $*$-maximal ideal $Q$ of $R[X]$ is extended from $R$, that…

We investigate conditions under which the identity matrix $I_n$ can be continuously factorized through a continuous $N\times N$ matrix function $A$ with domain in $\mathbb{R}$. We study the relationship of the dimension $N$, the diagonal…

We give an algorithm for computing the factor ring of a given ideal in a Dedekind domain with finite rank, which runs in deterministic and polynomial-time. We provide two applications of the algorithm: judging whether a given ideal is prime…

In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…

We introduce a family of squarefree monomial ideals associated to finite simple graphs, whose monomial generators correspond to closed neighborhood of vertices of the underlying graph. Any such ideal is called the closed neighborhood ideal…