SearcharxivSearch

arXiv subjects

Mihai Cipu

Publications and source records attributed to Mihai Cipu.

8 recordsLinked to original sources

On the Hilbert depth of the quotient ring of the edge ideal of a star graph

Let $S_n=K[x_1,\ldots,x_n,y]$ and $I_n=(x_1y,x_2y,\ldots,x_ny)\subset S_n$ be the edge ideal of star graph. We prove that $\operatorname{hdepth}(S_n/I_n)\geq \left\lceil \frac{n}{2} \right\rceil + \left\lfloor \sqrt{n} \right\rfloor - 2$. Also, we show that for any $\varepsilon>0$, there exists some integer $A=A(\varepsilon)\geq 0$ such that $\operatorname{hdepth}(S_n/I_n)\leq \left\lceil \frac{n}{2} \right\rceil + \left\lfloor \varepsilon n \right\rfloor + A - 2$. We deduce that $\lim\limits_{n\to\infty} \frac{1}{n}\operatorname{hdepth}(S_n/I_n) = \frac{1}{2}$.

math.AC

Apollonius circles and the number of irreducible factors of polynomials

We provide upper bounds for the sum of the multiplicities of the non-constant irreducible factors that appear in the canonical decomposition of a polynomial $f(X)\in\mathbb{Z}[X]$, in case all the roots of $f$ lie inside an Apollonius circle associated to two points on the real axis with integer abscissae $a$ and $b$, with ratio of the distances to these points depending on the admissible divisors of $f(a)$ and $f(b)$. In particular, we obtain such upper bounds for the case where $f(a)$ and $f(b)$ have few prime factors, and $f$ is an Eneström-Kakeya polynomial, or a Littlewood polynomial, or has a large leading coefficient. Similar results are also obtained for multivariate polynomials over arbitrary fields, in a non-Archimedean setting.

math.NT

Apollonius circles and irreducibility criteria for polynomials

We prove the irreducibility of integer polynomials $f(X)$ whose roots lie inside an Apollonius circle associated to two points on the real axis with integer abscisae $a$ and $b$, with ratio of the distances to these points depending on the canonical decomposition of $f(a)$ and $f(b)$. In particular, we obtain irreducibility criteria for the case where $f(a)$ and $f(b)$ have few prime factors, and $f$ is either an Eneström-Kakeya polynomial, or has a large leading coefficient. Analogous results are also provided for multivariate polynomials over arbitrary fields, in a non-Archimedean setting.

math.NT

There is no Diophantine $D(-1)$--quadruple

A set of positive integers with the property that the product of any two of them is the successor of a perfect square is called Diophantine $D(-1)$--set. Such objects are usually studied via a system of generalized Pell equations naturally attached to the set under scrutiny. In this paper, an innovative technique is introduced in the study of Diophantine $D(-1)$--quadruples. The main novelty is the uncovering of a quadratic equation relating various parameters describing a hypothetical $D(-1)$--quadruple with integer entries. In combination with extensive computations, this idea leads to the confirmation of the conjecture according to which there is no Diophantine $D(-1)$--quadruple.

math.NT

Searching for Diophantine quintuples

We consider Diophantine quintuples $\{a, b, c, d, e\}$. These are sets of distinct positive integers, the product of any two elements of which is one less than a perfect square. It is conjectured that there are no Diophantine quintuples; we improve on current estimates to show that there are at most $1.18\cdot 10^{27}$ Diophantine quintuples.

math.NT

On the Behaviour of Stanley Depth under Variable Adjunction

Let $S=K[x_1,...,x_n]$ be a polynomial ring in $n$ variables over the field $K$. For integers $1\leq t< n$ consider the ideal $I=(x_1,...,x_t)\cap(x_{t+1}, ...,x_n)$ in $S$. In this paper we bound from above the Stanley depth of the ideal $I'=(I,x_{n+1},...,x_{n+p})\subset S'=S[x_{n+1},...,x_{n+p}]$. We give similar upper bounds for the Stanley depth of the ideal $(I_{n,2},x_{n+1},...,x_{n+p})$, where $I_{n,2}$ is the square free Veronese ideal of degree 2 in $n$ variables.

math.AC

On a conjecture on exponential Diophantine equations

We study the solutions of a Diophantine equation of the form $a^x+b^y=c^z$, where $a\equiv 2 \pmod 4$, $b\equiv 3 \pmod 4$ and $\gcd (a,b,c)=1$. The main result is that if there exists a solution $(x,y,z)=(2,2,r)$ with $r>1$ odd then this is the only solution in integers greater than 1, with the possible exception of finitely many values $(c,r)$. We also prove the uniqueness of such a solution if any of $a$, $b$, $c$ is a prime power. In a different vein, we obtain various inequalities that must be satisfied by the components of a putative second solution.

math.NT