相关论文: On the distribution of reducible polynomials
We characterize the downsets of integer partitions (ordered by containment of Ferrers diagrams) and compositions (ordered by the generalized subword order) which have finite dimension in the sense of Dushnik and Miller. In the case of…
We give a uniform interpretation of the classical continuous Chebyshev's and Hahn's orthogonal polynomials of discrete variable in terms of Feigin's Lie algebra gl(N), where N is any complex number. One can similarly interpret Chebyshev's…
It is known that all modular forms on SL_2(Z) can be expressed as a rational function in eta(z), eta(2z) and eta(4z). By utilizing known theorems, and calculating the order of vanishing, we can compute the eta-quotients for a given level.…
We study the zero distribution of non-orthogonal polynomials attached to $g(n)=s(n)=n^2$: \begin{equation*} Q_n^g(x)= x \sum_{k=1}^n g(k) \, Q_{n-k}^g(x), \quad Q_0^g(x):=1. \end{equation*} It is known that the case $g=id$ involves…
Let $F_q$ be a field with $q$ elements, where $q$ is a power of a prime number $p\geq 5$. For any integer $m\geq 2$ and $a\in F_q^*$ such that the polynomial $x^m-a$ is irreducible in $F_q[x]$, we combine two different methods to construct…
Let X be a projective curve defined over Q and t a non-constant Q-rational function on X of degree at least 2. For every integer n pick a point P_n on X such that t(P_n)=n. A result of Dvornicich and Zannier implies that, for large N, among…
Let n be a positive integer, and let R be a finitely presented (but not necessarily finite dimensional) associative algebra over a computable field. We examine algorithmic tests for deciding (1) if every n-dimensional representation of R is…
Let $R$ be an integral domain and $B=R[x_1,\ldots,x_n]$ be the polynomial ring. In this paper, we consider retracts of $B[1/M]$ for a monomial $M$. We show that (1) if $M=\prod_{i=1}^nx_i$, then every retract is a Laurent polynomial ring…
In this paper, a randomized algorithm for deciding the irreducibility of an irreducible polynomial and factoring a reducible polynomial over the field of rational numbers is presented. The main idea underlying the algorithm is based on…
Given a subset $S=\{s_0, s_1\}$ of the complex plane with two points and an infinite subset ${\mathscr S}$ of $S\times {\mathbb N}$, where ${\mathbb N}=\{0,1,2,\dots\}$ is the set of nonnegative integers, we ask for a lower bound for the…
Let $R$ be a two-dimensional regular local ring. In this paper, we prove that there is a bijection between the set of all valuations of $Quot(R)$ centered at $R$ and valuations of $k(x,y)$ centered at $k[x,y]_{(x,y)}$, where $k$ is the…
The aim of this work is to describe the equivalence relations in $\Q/\Z$ that arise as the rational lamination of polynomials with all cycles repelling. We also describe where in parameter space one can find a polynomial with all cycles…
The absolute separation of a polynomial is the minimum nonzero difference between the absolute values of its roots. In the case of polynomials with integer coefficients, it can be bounded from below in terms of the degree and the height…
For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…
This work is a Master thesis supervised by Prof. Dr. H.W. Lenstra. Lenstra and Silverberg showed that each reduced order has a universal grading, which can be viewed as the `largest possible grading'. We present an algorithm to compute the…
Let either $R_k(t) := |P_k(e^{it})|^2$ or $R_k(t) := |Q_k(e^{it})|^2$, where $P_k$ and $Q_k$ are the usual Rudin-Shapiro polynomials of degree $n-1$ with $n=2^k$. The graphs of the trigonometric polynomials $R_k$ on the period suggest many…
We identify the scaling region of a width O(n^{-1}) in the vicinity of the accumulation points $t=\pm 1$ of the real roots of a random Kac-like polynomial of large degree n. We argue that the density of the real roots in this region tends…
Let $f_n$ be a random polynomial of degree $n$, whose coefficients are independent and identically distributed random variables with mean-zero and variance one. Let $\Delta(f_n)$ denote the discriminant of $f_n$, that is $\Delta(f_n) =…
By the m-spectrum of a real number q>1 we mean the set Y^m(q) of values p(q) where p runs over the height m polynomials with integer coefficients. These sets have been extensively investigated during the last fifty years because of their…
We classify all post-critically finite unicritical polynomials defined over the maximal totally real algebraic extension of ${\mathbb Q}$. Two auxiliary results used in the proof of this result may be of some independent interest. The first…