Related papers: Factorization and irreducibility of composed produ…
Let $S \subset R$ be an arbitrary subset of a unique factorization domain $R$ and $\K$ be the field of fractions of $R$. The ring of integer-valued polynomials over $S$ is the set $\mathrm{Int}(S,R)= \{ f \in \mathbb{K}[x]: f(a) \in R\…
In this paper, we define and prove basic properties of complement polyhedral product spaces, dual complexes and polyhedral product complexes. Then we compute the universal algebra of polyhedral product complexes under certain split…
We determine the graded decompositions of fusion products of finite-dimensional irreducible representations for simple Lie algebras of rank two. Moreover, we give generators and relations for these representations and obtain as a…
The product monomial crystal was defined by Kamnitzer, Tingley, Webster, Weekes, and Yacobi for any semisimple simply-laced Lie algebra $\mathfrak{g}$, and depends on a collection of parameters $\mathbf{R}$. We show that a family of…
An irreducible element of a commutative ring is absolutely irreducible if no power of it has more than one (essentially different) factorization into irreducibles. In the case of the ring $\text{Int}(D)=\{f\in K[x]\mid f(D)\subseteq D\}$,…
We give a short proof of the inner product conjecture for the symmetric Macdonald polynomials of type $A_{n-1}$. As a special case, the corresponding constant term conjecture is also proved.
Products and sums of random matrices have seen a rapid development in the past decade due to various analytical techniques available. Two of these are the harmonic analysis approach and the concept of polynomial ensembles. Very recently, it…
Arithmetical congruence monoids, which arise in non-unique factorization theory, are multiplicative monoids $M_{a,b}$ consisting of all positive integers $n$ satsfying $n \equiv a \bmod b$. In this paper, we examine the asymptotic behavior…
We provide upper bounds on the total number of irreducible factors, and in particular irreducibility criteria for some classes of bivariate polynomials $f(x,y)$ over an arbitrary field $\mathbb{K}$. Our results rely on information on the…
We formulate and prove a criterion for reducibility of a quadratic polynomial over the integers. The main theorem was suggested by the teaching experience with the concrete material called "the polynomial box". Through the corollaries we…
We study the monodromy groups of compositions of two indecomposable polynomials. In particular, we show that such monodromy groups either fulfill a certain "largeness" property, or are in an explicit list of exceptions. Such largeness…
This paper gives a generic form of the diamond lemma, which includes support for additive and topological structures of the base set, and which does not require any further structure (e.g. an associative multiplication operation) to be…
We introduce polyhedral products in an $\infty$-categorical setting. We generalize a splitting result by Bahri, Bendersky, Cohen, and Gitler that determines the stable homotopy type of the a polyhedral product. We also introduce a motivic…
We present a theorem about irreducibility of a polynomial that is the resultant of two others polynomials. The proof of this fact is based on the field theory. We also consider the converse theorem and some examples.
The integration by parts recurrence relations allow to reduce some Feynman integrals to more simple ones (with some lines missing). Nevertheless the possibility of such reduction for the given particular integral was unclear. The recently…
The "back-stabilization number" for products of Schubert polynomials is the distance the corresponding permutations must be shifted before the structure constants stabilize. We give an explicit formula for this number and thereby prove a…
We prove that the complexity of the Conjugacy Problems for wreath products and for free solvable groups is decidable in polynomial time. For the wreath product AwrB, we must assume the decidability in polynomial time of the Conjugacy…
We study symplectic and projective structures on small covers over products of polygons. We introduce the factor-compatible class for small covers over products of polygons and prove that every factor-compatible small cover admits a smooth…
For a degree $n$ polynomial $f$ over the rationals, the elements in the fiber $f^{-1}(a)$ are of degree $n$ over $\mathbb Q$ for most rational values $a$ by Hilbert's irreducibility theorem. Determining the set of exceptional $a$'s without…
An atomic monoid $M$ is called length-factorial if for every non-invertible element $x \in M$, no two distinct factorizations of $x$ into irreducibles have the same length (i.e., number of irreducible factors, counting repetitions). The…