English
Related papers

Related papers: Corners with polynomial side length

200 papers

A polynomial $p(x,y)$ on a region $S$ in the plane is called a packing polynomial if the restriction of $p(x,y)$ to $S\cap \mathbb{Z}^2$ yields a bijection to $\mathbb{N}$. In this paper, we determine all quadratic packing polynomials on…

Combinatorics · Mathematics 2014-09-02 Madeline Brandt

We study the root distribution of a sequence of polynomials $\{P_n(z)\}_{n=0}^{\infty}$ with the rational generating function $$ \sum_{n=0}^{\infty} P_n(z)t^n= \frac{1}{1+ B(z)t^\ell +A(z)t^k}$$ for $(k,\ell)=(3,2)$ and $(4,3)$ where $A(z)$…

Complex Variables · Mathematics 2019-10-02 Innocent Ndikubwayo

We prove that for any circulant matrix $C$ of size $n\times n$ with the monic characteristic polynomial $p(z)$, the spectrum of its $(n-1)\times(n-1)$ submatrix $C_{n-1}$ constructed with first $n-1$ rows and columns of $C$ consists of all…

Classical Analysis and ODEs · Mathematics 2025-07-01 Olga Kushel , Mikhail Tyaglov

We treat the following "polynomial moment problem": for a complex polynomial P(z) and distinct complex numbers a,b such that P(a)=P(b) to describe polynomials q(z)=Q'(z) orthogonal to all degrees of P(z) on the segment [a,b]. We show that…

Complex Variables · Mathematics 2007-05-23 F. Pakovich

We give three proofs of the following result conjectured by Carriegos, De Castro-Garc\'{\i}a and Mu\~noz Casta\~neda in their work on enumeration of control systems: when $\binom{k+1}{2} \le n < \binom{k+2}{2}$, there are as many partitions…

Combinatorics · Mathematics 2022-03-23 Emmanuel Briand

Let $G$ be a finite $D$-quasirandom group and $A \subset G^{k}$ a $\delta$-dense subset. Then the density of the set of side lengths $g$ of corners \[ \{(a_{1},\dots,a_{k}),(ga_{1},a_{2},\dots,a_{k}),\dots,(ga_{1},\dots,ga_{k})\} \subset A…

Combinatorics · Mathematics 2018-08-20 Pavel Zorin-Kranich

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…

We use a generalization of Vinogradov's mean value theorem of S. Parsell, S. Prendiville and T. Wooley and ideas of W. Schmidt to give nontrivial bounds for the number of solutions to polynomial congruences, for arbitrary polynomials, when…

Number Theory · Mathematics 2013-02-27 Bryce Kerr

In this paper, we provide a new method to find all zeros of polynomials with quaternionic coefficients located on only one side of the powers of the variable (these polynomials are called simple polynomials). This method is much more…

Rings and Algebras · Mathematics 2011-09-14 Lianggui Feng , Kaiming Zhao

Given coprime integers $k, \ell$ with $k > \ell \geqslant 1$ and arbitrary complex polynomials $A(z), B(z)$ with $\deg(A(z)B(z))\geqslant 1$, we consider the polynomial sequence $\{P_n(z)\}$ satisfying a three-term recurrence…

Complex Variables · Mathematics 2024-11-08 Alex Samuel Bamunoba , Innocent Ndikubwayo

We determine simplicity criteria in characteristics 0 and $p$ for a ubiquitous class of iterated skew polynomial rings in two indeterminates over a base ring. One obstruction to simplicity is the possible existence of a canonical normal…

Rings and Algebras · Mathematics 2013-01-24 David A. Jordan , Imogen E. Wells

For a real polynomial $p = \sum_{i=0}^{n} c_ix^i$ with no negative coefficients and $n\geq 6$, let $\beta (p) = \inf_{i=1}^{n-1} c_i^2/c_{i+1}c_{i-1}$ (so $\beta (p) \geq 1$ entails that $p$ is log concave). If $\beta(p) > 1.45...$, then…

Classical Analysis and ODEs · Mathematics 2010-10-01 David Handelman

For a set of graphs $\mathcal{H}$, the \textsc{$\mathcal{H}$-free Edge Deletion} problem asks to find whether there exist at most $k$ edges in the input graph whose deletion results in a graph without any induced copy of $H\in\mathcal{H}$.…

Data Structures and Algorithms · Computer Science 2014-11-19 N. R. Aravind , R. B. Sandeep , Naveen Sivadasan

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…

Number Theory · Mathematics 2021-03-30 Anca Iuliana Bonciocat , Nicolae Ciprian Bonciocat , Yann Bugeaud , Mihai Cipu

Let $P_1, \ldots, P_m \in K[y]$ be polynomials with distinct degrees, no constant terms and coefficients in a general locally compact topological field $K$. We give a quantitative count of the number of polynomial progressions $x, x+P_1(y),…

Number Theory · Mathematics 2024-11-27 Ben Krause , Mariusz Mirek , Sarah Peluse , James Wright

The existence of a nontrivial polynomially convex hull with every point a one-point Gleason part and with no nonzero bounded point derivations is established. This strengthens the \hbox{celebrated} result of Stolzenberg that there exists a…

Complex Variables · Mathematics 2016-05-16 Brian J. Cole , Swarup N. Ghosh , Alexander J. Izzo

This note is motivated by an old result of Kronecker on monic polynomials with integer coefficients having all their roots in the unit disc. We call such polynomials Kronecker polynomials for short. Let $k(n)$ denote the number of Kronecker…

Number Theory · Mathematics 2015-07-10 Pantelis A. Damianou

We construct skew corner-free subsets of $[n]^2$ of size $n^2\exp(-O(\sqrt{\log n}))$, thereby improving on recent bounds of the form $\Omega(n^{5/4})$ obtained by Pohoata and Zakharov. In the other direction, we prove that any such set has…

Combinatorics · Mathematics 2025-04-30 Adrian Beker

Recently, cutting planes derived from maximal lattice-free convex sets have been studied intensively by the integer programming community. An important question in this research area has been to decide whether the closures associated with…

Optimization and Control · Mathematics 2013-01-10 Amitabh Basu , Robert Hildebrand , Matthias Köppe

It is conjectured that all separable polynomials with integers coefficients, satisfying some local conditions, take infinitely many square free values on integer arguments. But not a single polynomial of degree greater than $3$ is proven to…

Number Theory · Mathematics 2023-03-14 Prem Prakash Pandey