Nontrivial upper bounds for the least common multiple of an arithmetic progression

In this paper, we establish some nontrivial and effective upper bounds for the least common multiple of consecutive terms of a finite arithmetic progression. Precisely, we prove that for any two coprime positive integers [Formula: see text] and [Formula: see text], with [Formula: see text], we have [Formula: see text] where [Formula: see text]. If in addition [Formula: see text] is a prime number and [Formula: see text], then we prove that for any [Formula: see text], we have [Formula: see text], where [Formula: see text]. Finally, we apply those inequalities to estimate the arithmetic function [Formula: see text] defined by [Formula: see text] ([Formula: see text]), as well as some values of the generalized Chebyshev function [Formula: see text].

The Diophantine equation (m2 + n2)x + (2mn)y = (m + n)2z

For fixed coprime positive integers [Formula: see text], [Formula: see text], [Formula: see text] with [Formula: see text] and [Formula: see text], there is a conjecture that the exponential Diophantine equation [Formula: see text] has only the positive integer solution [Formula: see text] for any positive integer [Formula: see text]. This is the analogue of Jésmanowicz conjecture. In this paper, we consider the equation [Formula: see text], where [Formula: see text] are coprime positive integers, and prove that the equation has no positive integer solution if [Formula: see text] and [Formula: see text].

Classification of irreducible weak modules over Virasoro vertex operator algebras

The classification of irreducible weak modules over the Virasoro vertex operator algebra [Formula: see text] is obtained in this paper. As one of the main results, we also classify all irreducible weak modules over the simple Virasoro vertex operator algebras [Formula: see text] for [Formula: see text] [Formula: see text], where [Formula: see text] are coprime positive integers.

The n-dimensional Stern–Brocot tree

This paper generalizes the Stern–Brocot tree to a tree that consists of all sequences of [Formula: see text] coprime positive integers. As for [Formula: see text] each sequence [Formula: see text] is the sum of a specific set of other coprime sequences, its Stern–Brocot set [Formula: see text], where [Formula: see text] is the degree of [Formula: see text] With an orthonormal base as the root, the tree defines a fast iterative structure on the set of distinct directions in [Formula: see text] and a multiresolution partition of [Formula: see text]. Basic proofs rely on a matrix representation of each coprime sequence, where the Stern–Brocot set forms the matrix columns. This induces a finitely generated submonoid [Formula: see text] of [Formula: see text], and a unimodular multidimensional continued fraction algorithm, also generalizing [Formula: see text]. It turns out that the [Formula: see text]-dimensional subtree starting with a sequence [Formula: see text] is isomorphic to the entire [Formula: see text]-dimensional tree. This allows basic combinatorial properties to be established. It turns out that also in this multidimensional version, Fibonacci-type sequences have maximal sequence sum in each generation.

Modular Invariant Representations of the Superconformal Algebra

We compute the modular transformation formula of the characters for a certain family of (finitely or uncountably many) simple modules over the simple $\mathcal{N}=2$ vertex operator superalgebra of central charge $c_{p,p^{\prime }}=3\left (1-\frac{2p^{\prime }}{p}\right ),$ where (p, p′) is a pair of coprime positive integers such that p ≥ 2. When p′ = 1, the formula coincides with that of the $\mathcal{N}=2$ unitary minimal series found by F. Ravanini and S.-K. Yang. In addition, we study the properties of the corresponding “modular S-matrix”, which is no longer a matrix if p′≥ 2.

$(s,t)$-Cores: a Weighted Version of Armstrong’s Conjecture

The study of core partitions has been very active in recent years, with the study of $(s,t)$-cores — partitions which are both $s$- and $t$-cores %mdash; playing a prominent role. A conjecture of Armstrong, proved recently by Johnson, says that the average size of an $(s,t)$-core, when $s$ and $t$ are coprime positive integers, is $\frac1{24}(s-1)(t-1)(s+t-1)$. Armstrong also conjectured that the same formula gives the average size of a self-conjugate $(s,t)$-core; this was proved by Chen, Huang and Wang.In the present paper, we develop the ideas from the author's paper [J. Combin. Theory Ser. A 118 (2011) 1525—1539], studying actions of affine symmetric groups on the set of $s$-cores in order to give variants of Armstrong's conjectures in which each $(s,t)$-core is weighted by the reciprocal of the order of its stabiliser under a certain group action. Informally, this weighted average gives the expected size of the $t$-core of a random $s$-core.

Cyclic Sieving and Rational Catalan Theory

Let $a < b$ be coprime positive integers. Armstrong, Rhoades, and Williams (2013) defined a set NC(a,b) of `rational noncrossing partitions', which form a subset of the ordinary noncrossing partitions of $\{1, 2, \dots, b-1\}$. Confirming a conjecture of Armstrong et. al., we prove that NC(a,b) is closed under rotation and prove an instance of the cyclic sieving phenomenon for this rotational action. We also define a rational generalization of the $\mathfrak{S}_a$-noncrossing parking functions of Armstrong, Reiner, and Rhoades.

Rational Associahedra and Noncrossing Partitions

Each positive rational number $x>0$ can be written uniquely as $x=a/(b-a)$ for coprime positive integers $0<a<b$. We will identify $x$ with the pair $(a,b)$. In this paper we define for each positive rational $x>0$ a simplicial complex $\mathsf{Ass}(x)=\mathsf{Ass}(a,b)$ called the rational associahedron. It is a pure simplicial complex of dimension $a-2$, and its maximal faces are counted by the rational Catalan number $$\mathsf{Cat}(x)=\mathsf{Cat}(a,b):=\frac{(a+b-1)!}{a!\,b!}.$$The cases $(a,b)=(n,n+1)$ and $(a,b)=(n,kn+1)$ recover the classical associahedron and its "Fuss-Catalan" generalization studied by Athanasiadis-Tzanaki and Fomin-Reading. We prove that $\mathsf{Ass}(a,b)$ is shellable and give nice product formulas for its $h$-vector (the rational Narayana numbers) and $f$-vector (the rational Kirkman numbers). We define $\mathsf{Ass}(a,b)$ via rational Dyck paths: lattice paths from $(0,0)$ to $(b,a)$ staying above the line $y = \frac{a}{b}x$. We also use rational Dyck paths to define a rational generalization of noncrossing perfect matchings of $[2n]$. In the case $(a,b) = (n, mn+1)$, our construction produces the noncrossing partitions of $[(m+1)n]$ in which each block has size $m+1$.

Rational Catalan Combinatorics: The Associahedron

International audience Each positive rational number $x>0$ can be written $\textbf{uniquely}$ as $x=a/(b-a)$ for coprime positive integers 0<$a$<$b$. We will identify $x$ with the pair $(a,b)$. In this extended abstract we use $\textit{rational Dyck paths}$ to define for each positive rational $x>0$ a simplicial complex $\mathsf{Ass} (x)=\mathsf{Ass} (a,b)$ called the $\textit{rational associahedron}$. It is a pure simplicial complex of dimension $a-2$, and its maximal faces are counted by the $\textit{rational Catalan number}$ $\mathsf{Cat} (x)=\mathsf{Cat}(a,b):=\frac{(a+b-1)! }{ a! b!}.$ The cases $(a,b)=(n,n+1)$ and $(a,b)=(n,kn+1)$ recover the classical associahedron and its Fuss-Catalan generalization studied by Athanasiadis-Tzanaki and Fomin-Reading. We prove that $\mathsf{Ass} (a,b)$ is shellable and give nice product formulas for its $h$-vector (the $\textit{rational Narayana numbers}$) and $f$-vector (the $\textit{rational Kirkman numbers}$). We define $\mathsf{Ass} (a,b)$ .

MINIMAL DEGREE SEQUENCE FOR TORUS KNOTS OF TYPE (p, q)

In this paper we prove the following result: for coprime positive integers p and q with p < q, if r is the least positive integer such that 2p-1 and q + r are coprime, then the minimal degree sequence for a torus knot of type (p, q) is the triple (2p - 1, q + r, d) or (q + r, 2p - 1, d) where q + r + 1 ≤ d ≤ 2q - 1.