A positive even number is said to be a Maillet number if it can be written as the difference between two primes, and a Kronecker number if it can be written in infinitely many ways as the difference between two primes. It is believed that all even numbers are Kronecker numbers. We study the division and multiplication of Kronecker numbers and show that these numbers are rather abundant. We prove that there is a computable constant k and a set D consisting of at most 720 computable Maillet numbers such that, for any integer n, $kn$ can be expressed as a product of a Kronecker number and a Maillet number in D. We also prove that every positive rational number can be written as a ratio of two Kronecker numbers.

We study a pair consisting of a smooth 3-fold defined over an algebraically closed field and a “general” ${\Bbb R}$-ideal. We show that the minimal log discrepancy (“mld” for short) of every such a pair is computed by a prime divisor obtained by at most two weighted blow-ups. This bound is regarded as a weighted blow-up version of Mustaţă–Nakamura’s conjecture. We also show that if the mld of such a pair is not less than 1, then it is computed by at most one weighted blow-up. As a consequence, ACC of mld holds for such pairs.

Let G be a graph with m edges, minimum degree $\delta $ and containing no cycle of length 4. Answering a question of Bollobás and Scott, Fan et al. [‘Bisections of graphs without short cycles’, Combinatorics, Probability and Computing 27(1) (2018), 44–59] showed that if (i) G is $2$-connected, or (ii) $\delta \ge 3$, or (iii) $\delta \ge 2$ and the girth of G is at least 5, then G admits a bisection such that $\max \{e(V_1),e(V_2)\}\le (1/4+o(1))m$, where $e(V_i)$ denotes the number of edges of G with both ends in $V_i$. Let $s\ge 2$ be an integer. In this note, we prove that if $\delta \ge 2s-1$ and G contains no $K_{2,s}$ as a subgraph, then G admits a bisection such that $\max \{e(V_1),e(V_2)\}\le (1/4+o(1))m$.

We prove the following conjecture of Z.-W. Sun [‘On congruences related to central binomial coefficients’, J. Number Theory 13(11) (2011), 2219–2238]. Let p be an odd prime. Then

$$ \begin{align*} \sum_{k=1}^{p-1}\frac{\binom{2k}k}{k2^k}\equiv-\frac12H_{{(p-1)}/2}+\frac7{16}p^2B_{p-3}\pmod{p^3}, \end{align*} $$

where $H_n$ is the nth harmonic number and $B_n$ is the nth Bernoulli number. In addition, we evaluate $\sum _{k=0}^{p-1}(ak+b)\binom {2k}k/2^k$ modulo $p^3$ for any p-adic integers $a, b$.

Given any polynomial in two variables of degree at most three with rational integer coefficients, we obtain a new search bound to decide effectively if it has a zero with rational integer coefficients. On the way we encounter a natural problem of estimating singular points. We solve it using elementary invariant theory but an optimal solution would seem to be far from easy even using the full power of the standard Height Machine.

We classify the irreducible unitary representations of closed simple groups of automorphisms of trees acting $2$-transitively on the boundary and whose local action at every vertex contains the alternating group. As an application, we confirm Claudio Nebbia’s CCR conjecture on trees for $(d_0,d_1)$-semi-regular trees such that $d_0,d_1\in \Theta $, where $\Theta $ is an asymptotically dense set of positive integers.

A generalisation of the well-known Pell sequence $\{P_n\}_{n\ge 0}$ given by $P_0=0$, $P_1=1$ and $P_{n+2}=2P_{n+1}+P_n$ for all $n\ge 0$ is the k-generalised Pell sequence $\{P^{(k)}_n\}_{n\ge -(k-2)}$ whose first k terms are $0,\ldots ,0,1$ and each term afterwards is given by the linear recurrence $P^{(k)}_n=2P^{(k)}_{n-1}+P^{(k)}_{n-2}+\cdots +P^{(k)}_{n-k}$. For the Pell sequence, the formula $P^2_n+P^2_{n+1}=P_{2n+1}$ holds for all $n\ge 0$. In this paper, we prove that the Diophantine equation

$$ \begin{align*} (P^{(k)}_n)^2+(P^{(k)}_{n+1})^2=P^{(k)}_m \end{align*} $$

has no solution in positive integers $k, m$ and n with $n>1$ and $k\ge 3$.

The minimum number of idempotent generators is calculated for an incidence algebra of a finite poset over a commutative ring. This quantity equals either $\lceil \log _2 n\rceil $ or $\lceil \log _2 n\rceil +1$, where n is the cardinality of the poset. The two cases are separated in terms of the embedding of the Hasse diagram of the poset into the complement of the hypercube graph.

In this paper, the ordering properties of convex and increasing convex orders of the dependent random variables are studied. Some closure properties of the convex and increasing convex orders under independent random variables are extended to the dependent random variables under the Archimedean copula. Two applications are provided to illustrate our results.

We prove an equality, predicted in the physical literature, between the Jeffrey–Kirwan residues of certain explicit meromorphic forms attached to a quiver without loops or oriented cycles and its Donaldson–Thomas type invariants.

In the special case of complete bipartite quivers we also show independently, using scattering diagrams and theta functions, that the same Jeffrey–Kirwan residues are determined by the the Gross–Hacking–Keel mirror family to a log Calabi–Yau surface.

On the assumption of the Riemann hypothesis and a spacing hypothesis for the nontrivial zeros $1/2+i\gamma$ of the Riemann zeta function, we show that the sequence

\begin{equation*}\Gamma_{[a, b]} =\Bigg\{ \gamma : \gamma>0 \quad \mbox{and} \quad \frac{ \log\big(| \zeta^{(m_{\gamma })} (\frac12+ i{\gamma }) | / (\!\log{{\gamma }} )^{m_{\gamma }}\big)}{\sqrt{\frac12\log\log {\gamma }}} \in [a, b] \Bigg\},\end{equation*}

${\gamma }$

$a<b$

$m_\gamma$

$1/2+i{\gamma }$

${\gamma }$

$\gamma (\!\log T)/2\pi$

${\gamma }\in \Gamma_{[a, b]}$

$0<{\gamma }\leq T$

We propose generating functions, $\textrm {RGF}_p(x)$, for the quotients of numerical semigroups which are related to the Sylvester denumerant. Using MacMahon’s partition analysis, we can obtain $\textrm {RGF}_p(x)$ by extracting the constant term of a rational function. We use $\textrm {RGF}_p(x)$ to give a system of generators for the quotient of the numerical semigroup $\langle a_1,a_2,a_3\rangle $ by p for a small positive integer p, and we characterise the generators of ${\langle A\rangle }/{p}$ for a general numerical semigroup A and any positive integer p.

Let $\alpha $ be a complex-valued $2$-cocycle of a finite group G with $\alpha $ chosen so that the $\alpha $-characters of G are class functions and analogues of the orthogonality relations for ordinary characters are valid. Then the real or rational elements of G that are also $\alpha $-regular are characterised by the values that the irreducible $\alpha $-characters of G take on those respective elements. These new results generalise two known facts concerning such elements and irreducible ordinary characters of $G;$ however, the initial choice of $\alpha $ from its cohomology class is not unique in general and it is shown the results can vary for a different choice.

Carlsen [‘$\ast $-isomorphism of Leavitt path algebras over $\Bbb Z$’, Adv. Math. 324 (2018), 326–335] showed that any $\ast $-homomorphism between Leavitt path algebras over $\mathbb Z$ is automatically diagonal preserving and hence induces an isomorphism of boundary path groupoids. His result works over conjugation-closed subrings of $\mathbb C$ enjoying certain properties. In this paper, we characterise the rings considered by Carlsen as precisely those rings for which every $\ast $-homomorphism of algebras of Hausdorff ample groupoids is automatically diagonal preserving. Moreover, the more general groupoid result has a simpler proof.

The complete classification of the finite simple groups that are $(2,3)$-generated is a problem which is still open only for orthogonal groups. Here, we construct $(2, 3)$-generators for the finite odd-dimensional orthogonal groups $\Omega _{2k+1}(q)$, $k\geq 4$. As a byproduct, we also obtain $(2,3)$-generators for $\Omega _{4k}^+(q)$ with $k\geq 3$ and q odd, and for $\Omega _{4k+2}^\pm (q)$ with $k\geq 4$ and $q\equiv \pm 1~ \mathrm {(mod~ 4)}$.

We study the Diophantine transference principle over function fields. By adapting the approach of Beresnevich and Velani [‘An inhomogeneous transference principle and Diophantine approximation’, Proc. Lond. Math. Soc. (3) 101 (2010), 821–851] to function fields, we extend many results from homogeneous to inhomogeneous Diophantine approximation. This also yields the inhomogeneous Baker–Sprindžuk conjecture over function fields and upper bounds for the general nonextremal scenario.

A system experiences random shocks over time, with two critical levels, d1 and d2, where $d_{1} \lt d_{2}$. k consecutive shocks with magnitudes between d1 and d2 partially damaging the system, causing it to transition to a lower, partially working state. Shocks with magnitudes above d2 have a catastrophic effect, resulting in complete failure. This theoretical framework gives rise to a multi-state system characterized by an indeterminate quantity of states. When the time between successive shocks follows a phase-type distribution, a detailed analysis of the system’s dynamic reliability properties such as the lifetime of the system, the time it spends in perfect functioning, as well as the total time it spends in partially working states are discussed.