scholarly journals On the least common multiple of polynomial sequences at prime arguments

Author(s):  
Ayan Nath ◽  
Abhishek Jha

Cilleruelo conjectured that if [Formula: see text] is an irreducible polynomial of degree [Formula: see text] then, [Formula: see text] In this paper, we investigate the analog of prime arguments, namely, [Formula: see text] where [Formula: see text] denotes a prime and obtain nontrivial lower bounds on it. Further, we also show some results regarding the greatest prime divisor of [Formula: see text]

2014 ◽  
Vol 57 (3) ◽  
pp. 551-561 ◽  
Author(s):  
Daniel M. Kane ◽  
Scott Duke Kominers

AbstractFor relatively prime positive integers u0 and r, we consider the least common multiple Ln := lcm(u0, u1..., un) of the finite arithmetic progression . We derive new lower bounds on Ln that improve upon those obtained previously when either u0 or n is large. When r is prime, our best bound is sharp up to a factor of n + 1 for u0 properly chosen, and is also nearly sharp as n → ∞.


2021 ◽  
Vol 7 (1) ◽  
Author(s):  
Carlo Sanna

AbstractFor every positive integer n and for every $$\alpha \in [0, 1]$$ α ∈ [ 0 , 1 ] , let $${\mathcal {B}}(n, \alpha )$$ B ( n , α ) denote the probabilistic model in which a random set $${\mathcal {A}} \subseteq \{1, \ldots , n\}$$ A ⊆ { 1 , … , n } is constructed by picking independently each element of $$\{1, \ldots , n\}$$ { 1 , … , n } with probability $$\alpha $$ α . Cilleruelo, Rué, Šarka, and Zumalacárregui proved an almost sure asymptotic formula for the logarithm of the least common multiple of the elements of $${\mathcal {A}}$$ A .Let q be an indeterminate and let $$[k]_q := 1 + q + q^2 + \cdots + q^{k-1} \in {\mathbb {Z}}[q]$$ [ k ] q : = 1 + q + q 2 + ⋯ + q k - 1 ∈ Z [ q ] be the q-analog of the positive integer k. We determine the expected value and the variance of $$X := \deg {\text {lcm}}\!\big ([{\mathcal {A}}]_q\big )$$ X : = deg lcm ( [ A ] q ) , where $$[{\mathcal {A}}]_q := \big \{[k]_q : k \in {\mathcal {A}}\big \}$$ [ A ] q : = { [ k ] q : k ∈ A } . Then we prove an almost sure asymptotic formula for X, which is a q-analog of the result of Cilleruelo et al.


2021 ◽  
Vol 2021 (5) ◽  
Author(s):  
Yahya Almumin ◽  
Mu-Chun Chen ◽  
Víctor Knapp-Pérez ◽  
Saúl Ramos-Sánchez ◽  
Michael Ratz ◽  
...  

Abstract We revisit the flavor symmetries arising from compactifications on tori with magnetic background fluxes. Using Euler’s Theorem, we derive closed form analytic expressions for the Yukawa couplings that are valid for arbitrary flux parameters. We discuss the modular transformations for even and odd units of magnetic flux, M, and show that they give rise to finite metaplectic groups the order of which is determined by the least common multiple of the number of zero-mode flavors involved. Unlike in models in which modular flavor symmetries are postulated, in this approach they derive from an underlying torus. This allows us to retain control over parameters, such as those governing the kinetic terms, that are free in the bottom-up approach, thus leading to an increased predictivity. In addition, the geometric picture allows us to understand the relative suppression of Yukawa couplings from their localization properties in the compact space. We also comment on the role supersymmetry plays in these constructions, and outline a path towards non-supersymmetric models with modular flavor symmetries.


2021 ◽  
Vol 58 (7) ◽  
pp. 0712002
Author(s):  
郭小庭 Guo Xiaoting ◽  
刘晓军 Liu Xiaojun ◽  
雷自力 Lei Zili ◽  
杨文军 Yang Wenjun ◽  
徐龙 Xu Long

Sign in / Sign up

Export Citation Format

Share Document