Related papers: Shortest Distance in Modular Cubic Polynomials

Classes of polynomial differential equations of degree n are considered. An explicit upper bound on the size of the coefficients are given which implies that each equation in the class has exactly n complex periodic solutions. In most of…

Consider a primitive polynomial $f$ in two variables, thought of as a map from the affine plane to the affine line. We study the minimimal compactification of $f$; from our result one deduces in particular that if one of the fibers of $f$…

Let $P$ be a set of $n$ points in the real plane contained in an algebraic curve $C$ of degree $d$. We prove that the number of distinct distances determined by $P$ is at least $c_d n^{4/3}$, unless $C$ contains a line or a circle. We also…

We study conformational properties of diluted dumbbell polymers which consist of two rings that are attached to both ends of a linear spacer segment by using analytical methods of field theory and bead-spring coarse-grained molecular…

In the first part of this paper we give a precise description of all the minimal decompositions of any bi-homogeneous polynomial $p$ (i.e. a partially symmetric tensor of $S^{d_1}V_1\otimes S^{d_2}V_2$ where $V_1,V_2$ are two complex,…

We investigate which polynomials can possibly occur as factors in the denominators of rational solutions of a given partial linear difference equation (PLDE). Two kinds of polynomials are to be distinguished, we call them /periodic/ and…

We say a map f:X \to Y is an \epsilon-embedding if it is continuous and the diameter of the fibres is less than \epsilon. This type of maps is used in the notion of Urysohn width (sometimes referred to as Alexandrov width), a_n(X). It is…

The problem of finding the distance from a given $n \times n$ matrix polynomial of degree $k$ to the set of matrix polynomials having the elementary divisor $(\lambda-\lambda_0)^j, \, j \geqslant r,$ for a fixed scalar $\lambda_0$ and $2…

Motivated by indoor localization by tripwire lasers, we study the problem of cutting a polygon into small-size pieces, using the chords of the polygon. Several versions are considered, depending on the definition of the "size" of a piece.…

It is known that a distance-regular graph with valency $k$ at least three admits at most two Q-polynomial structures. % In this note we show that all distance-regular graphs with diameter four and valency at least three admitting two…

For an odd prime $p$, we say a polynomial $f\in \mathbb F_p[X]$ computes square roots if $f(a)^2=a$ for all nonzero, perfect squares $a\in \mathbb F_p$. When $p\equiv 3 \mod 4$, it is easy to see that $f(X)=X^{\frac{p+1}{4}}$ is the…

In this paper, we first determine the minimum possible size of an Fq-linear set of rank k in PG(1, q^n). We obtain this result by relating it to the number of directions determined by a linearized polynomial whose domain is restricted to a…

We consider a natural variation of the concept of stabbing a segment by a simple polygon: a segment is stabbed by a simple polygon $\mathcal{P}$ if at least one of its two endpoints is contained in $\mathcal{P}$. A segment set $S$ is…

Let $\epsilon\in \{-1,1\}$. A sequence of prime numbers $p_1, p_2, p_3, ...$, such that $p_i=2p_{i-1}+\epsilon$ for all $i$, is called a {\it Cunningham chain} of the first or second kind, depending on whether $\epsilon =1$ or -1…

Let $f_1,\dots,f_k\in\mathbb{R}[X]$ be polynomials of degree at most $d$ with $f_1(0)=\dots=f_k(0)=0$. We show that there is an integer $n<x$ such that the fractional parts $\|f_i(n)\|\ll x^{c/k}$ for all $1\le i\le k$ and for some constant…

In this paper, we study slices of the parameter space of cubic polynomials, up to affine conjugacy, given by a fixed value of the multiplier at a non-repelling fixed point. In particular, we study the location of the $main\, cubioid$ in…

We study the dispersion of a point set, a notion closely related to the discrepancy. Given a real $r\in (0,1)$ and an integer $d\geq 2$, let $N(r,d)$ denote the minimum number of points inside the $d$-dimensional unit cube $[0,1]^d$ such…

Bundles of matrix polynomials are sets of matrix polynomials with the same size and grade and the same eigenstructure up to the specific values of the eigenvalues. It is known that the closure of the bundle of a pencil $L$ (namely, a matrix…

We consider a planar graph $G$ in which the edges have nonnegative integer lengths such that the length of every cycle of $G$ is even, and three faces are distinguished, called holes in $G$. It is known that there exists a packing of cuts…

We study short intervals which contain an ``almost square'', an integer $n$ that can be factored as $n = ab$ with $a$, $b$ close to $\sqrt{n}$. This is related to the problem on distribution of $n^2 \alpha \pmod 1$ and the problem on gaps…