Loading...
Loading...
Browse, search and filter the latest cybersecurity research papers from arXiv
For a morphism $f : X \to Y$ of schemes, we give a tropical criterion for which points of $Y$ (valued in a field, discrete valuation ring, number ring, or Dedekind domain) lift to $X$. Our criterion extends the firmaments of Abramovich to a wide range of morphisms, even logarithmic stable maps.
We prove the following statement about any Siegel modular form $F$ of degree $n$ and arbitrary odd level $N$ on the group $\Gamma_1^{(n)}(N)$. Let $A(F,T)$ denote the Fourier coefficients of $F$ and write $T=(T(i,j))$. Suppose that $F$ has a non-zero Fourier coefficient $A(F,T_0)$ such that $(T_0(n,n),N)=1$. Then there exist infinitely many odd and square-free (and thus fundamental) integers $m$ such that $m=\mathrm{discriminant}(T)$ and $A(F,T)\neq 0$. In the case of odd degrees, we prove a stronger result by replacing odd and square-free with odd and prime. We also prove quantitative results towards this. As a consequence, we can show in particular that the statement of the main result in arXiv:2408.03442 about the algebraicity of certain critical values of the spinor $L$-functions of holomorphic newforms (in the ambit of Deligne's conjectures) on congruence subgroups of $\mathrm{GSp}(3)$ is unconditional.
Ramanujan proved three famous congruences for the partition function modulo 5, 7, and 11. The first author and Boylan proved that these congruences are the only ones of this type. In 1984 Andrews introduced the $m$-colored Frobenius partition functions $c\phi_m$; these are natural higher-level analogues of the partition function which have attracted a great deal of attention in the ensuing decades. For each $m\in \{5, 7, 11\}$ there are two analogues of Ramanujan's congruences for $c\phi_m$, and for these $m$ we prove there are no congruences like Ramanujan's other than these six. Our methods involve a blend of theory and computation with modular forms.
Let $K/\mathbb{Q}$ be a finite extension. We prove that the minimal height of polynomials of degree $n$ of which all roots are in $K^\times$ increases exponentially in $n$. We determine the implied constant exactly for totally real $K$ and $K$ equal to $\mathbb{Q}(\sqrt{-1})$ or $\mathbb{Q}(\sqrt{-3})$.
We provide two new proofs of the infinitude of prime numbers, using the additive Ramsey-theoretic result known as Folkman's theorem (alternatively, one can think of these proofs as using Hindman's theorem). This adds to the existing literature deriving the infinitude of primes from Ramsey-type theorems.
We prove G\"ortz's combinatorial conjecture \cite{Go01} on dual shellability of admissible sets in Iwahori-Weyl groups, proving that the augmented admissible set $\widehat{\mathrm{Adm}}(\mu)$ is dual shellable for any dominant coweight $\mu$. This provides a uniform, elementary approach to establishing Cohen-Macaulayness of the special fibers of the local models with Iwahori level structure for all reductive groups-including residue characteristic $2$ and non-reduced root systems-circumventing geometric methods. Local models, which encode singularities of Shimura varieties and moduli of shtukas, have seen extensive study since their introduction by Rapoport-Zink, with Cohen-Macaulayness remaining a central open problem. While previous work relied on case-specific geometric analyses (e.g., Frobenius splittings \cite{HR23} or compactifications \cite{He13}), our combinatorial proof yields an explicit labeling that constructs the special fiber by sequentially adding irreducible components while preserving Cohen-Macaulayness at each step, a new result even for split groups.
For a natural number $k>1$, let $f_k(n)$ denote the number of distinct representations of a natural number $n$ of the form $p^k+q^k$ for primes $p,q$. We prove that, for all $k>1$, $$\limsup_{n\to\infty}f_k(n)=\infty.$$ This positively answers a conjecture of Erdos, which asks if there are natural numbers $n$ with arbitrarily many distinct representations of the form $p_1^k+p_2^k+\dots+p_k^k$ for primes $p_1,p_2,\dots,p_k$.
The Gross-Zagier formula on singular moduli can be seen as a calculation of the intersection multiplicity of two CM divisors on the integral model of a modular curve. We prove a generalization of this result to a Shimura curve.
Various card tricks involve under-down dealing, where alternatively one card is placed under the deck and the next card is dealt. We study how the cards need to be prepared in the deck to be dealt in order. The order in which the $N$ cards are prepared defines a permutation. In this work, we analyze general dealing patterns, considering properties of the resulting permutations. We give recursive formulas for these permutations, their inverses, the final dealt card, and the dealing order of the first card. We discuss some particular examples of dealing patterns and conclude with an analysis of several existing and novel magic card tricks making use of dealing patterns. Our discussions involve 30 existing sequences in the OEIS, and we introduce 44 new sequences to that database.
We investigate arithmetic properties of the sequence b(n) = B_MN(n) mod M obtained from the base-M to base-N shift map B_MN.We prove that b(n) is ultimately periodic exactly when every prime divisor of M also divides N; in that case we bound (and, for prime powers, determine) the minimal period.When the condition fails, b(n) supplies new solutions to the Prouhet-Tarry-Escott problem.To analyze this situation we introduce a family of finite-difference identities and use them to evaluate two weighted multivariate polynomial sums, thereby extending identities that arise from the classical sum-of-digits function (N=1).
In this paper we provide a classification on the sign distribution of $\Delta _{E,\ell}(n):= p_{E,\ell }(n)^2 - p_{E,\ell }(n-1) \, p_{E,\ell }(n+1)$, where \begin{equation*} \sum_{n =0}^{\infty} p_{E,\ell }(n) \, q^n := \prod_{n \in S} \left(1 - q^n \right)^{-f_{\ell}(n)},\quad (\ell \in \mathbb{N}, f_1\equiv 1). \end{equation*} We take the product over $1\in S \subset \mathbb{N}$ and denote the complement by $E$, the set of exceptions. In the case of $\ell=1$ and $E$ the multiples of $k$, $p_{E,1}\left( n\right) $ represents the number of $k$-regular partitions. More generally, let $f_{\ell}$ satisfy a certain growth condition. We determine the signs of $\Delta _{E,\ell }(n)$ for $\ell$ large. The signs mainly depend on the occurrence of subsets of $\{2,3,4,5\}$ as a part of the exception set and the residue class of $n$ modulo $ r$, where $r $ depends on $E$. For example, let $2,3 \in S$ and $4$ an exception. Let $n$ be large. Then for almost all $\ell$ we have \begin{equation*} \Delta _{E,\ell }(n) >0 \,\,\, \text{ for } n\equiv 2 \pmod{3}. \end{equation*} If we assume $3,4 \in S$ and $2$ an exception. Let $n$ be large. Then for almost all $\ell$ we have \begin{equation*} \Delta _{E,\ell }(n) < 0 \,\,\, \text{ for } n\equiv 2 \pmod{3}. \end{equation*} Note that this property is independent of the integers $k\in S,k>4$.
Nicolas inequality we deal can be written as \begin{equation}\label{Nicineq} e^\gamma \log\log N_x < \dfrac{N_x}{\varphi(N_x)}\,, \end{equation} where $x\ge 2$, $N_x$ denotes the product of the primes less or equal than $x$, $\gamma$ is the Euler constant and $\varphi$ is the Euler totient function. We show that there is a large $x_0>0$ such that this inequality fails infinitely often for integers $x\ge x_0$. To this aim we analyze the sign of the Big-o function in the Mertens estimate for the sum of reciprocals of primes that, we see, becomes crucial.
We give a linear relation between a cubic Gaussian period and a root of Shanks' cubic polynomial in wildly ramified cases.
We investigate homological stability for the space of sections of Fano fibrations over curves in the context of weak approximation, and establish it for projective bundles, as well as for conic and quadric surface bundles over curves.
This work explores new arithmetic and combinatorial structures arising from the interplay between Farey-type graphs, Fibonacci expansions, and operadic constructions. We introduce Fibonadic numbers, defined as an inverse limit under the Zeckendorf shift, equipped with a metric, order, and commutative rig structure. A normalization lemma provides canonical representatives, while quotients of the non-zero Fibonadic numbers under shifts and it's fundamental domain covering the circle via phi-values. Levels with associated functions encoding the decomposition of X into arithmetic layers. This research links number theory, combinatorics, discrete dynamics, operads, fractal geometry and the golden ratio.
We study the local Langlands functoriality transfer from $\text{SO}(5, F)$ to $\text{GL}(4, F)$ for arbitrary twists of several families of irreducible supercuspidal representations of $\text{GL}(4, F)$, where $F$ is a non-archimedean local field of characteristic zero. In doing so, we give equivalent conditions for such representations to be functoriality transfers from $\text{SO}(5, F)$ in terms of the Bushnell-Kutzko construction of supercuspidal representations by studying poles of local exterior square $L$-functions and the existence of non-zero local Shalika models. This article provides a starting point for an explicit characterization of this functoriality transfer in terms of type theory.
We present an algorithm which, given a connected smooth projective curve $X$ over an algebraically closed field of characteristic $p>0$ and its Hasse--Witt matrix, as well as a positive integer $n$, computes all \'etale Galois covers of $X$ with group $\mathbb{Z}/p^n\mathbb{Z}$. We compute the complexity of this algorithm when $X$ is defined over a finite field, and provide a complete implementation in SageMath, as well as some explicit examples. We then apply this algorithm to the computation of the cohomology complex of a locally constant sheaf of $\mathbb{Z}/p^n\mathbb{Z}$-modules on such a curve.
We use elementary methods to establish three key recurrence relations: one for derangement numbers, a second for harmonic numbers, and a third for degenerate harmonic numbers. Our results not only contribute to the understanding of the underlying structure of these numbers but also highlight the effectiveness of elementary techniques in discovering new mathematical properties. The findings have potential applications in various fields where these numbers appear, including combinatorics, probability, and computer science.