No cubic integer polynomial generates a Sidon sequence

Author(s):  
Artūras Dubickas ◽  
Aivaras Novikas
Keyword(s):  

Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 710
Author(s):  
Modjtaba Ghorbani ◽  
Maryam Jalali-Rad ◽  
Matthias Dehmer

Suppose ai indicates the number of orbits of size i in graph G. A new counting polynomial, namely an orbit polynomial, is defined as OG(x) = ∑i aixi. Its modified version is obtained by subtracting the orbit polynomial from 1. In the present paper, we studied the conditions under which an integer polynomial can arise as an orbit polynomial of a graph. Additionally, we surveyed graphs with a small number of orbits and characterized several classes of graphs with respect to their orbit polynomials.



2006 ◽  
Vol 31 (1) ◽  
pp. 147-153 ◽  
Author(s):  
Jesús A. De Loera ◽  
Raymond Hemmecke ◽  
Matthias Köppe ◽  
Robert Weismantel




2010 ◽  
Vol 06 (03) ◽  
pp. 587-602 ◽  
Author(s):  
YANN BUGEAUD ◽  
MAURICE MIGNOTTE

We discuss the following question: How close to each other can two distinct roots of an integer polynomial be? We summarize what is presently known on this and related problems, and establish several new results on root separation of monic, integer polynomials.





Sign in / Sign up

Export Citation Format

Share Document