中文
相关论文

相关论文: On A Conjecture Regarding Permutations Which Destr…

200 篇论文

In this paper, we shall prove the equality \[ \zeta(3,\{2\}^{n},1,2)=\zeta(\{2\}^{n+3})+2\zeta(3,3,\{2\}^{n}) \] conjectured by Hoffman using certain identities among iterated integrals on $\mathbb{P}^{1}\setminus\{0,1,\infty,z\}$.

数论 · 数学 2017-04-24 Minoru Hirose , Nobuo Sato

Recently, Z. W. Sun put forward a series of conjectures on monotonicity of combinatorial sequences in the form of $\{z_n/z_{n-1}\}_{n=N}^\infty$ and $\{\sqrt[n+1]{z_{n+1}}/\sqrt[n]{z_n}\}_{n=N}^\infty$ for some positive integer $N$, where…

组合数学 · 数学 2015-12-04 Brian Y. Sun

In his 1979 paper Samuel Wagstaff studied the problem of bounding the first prime in an arithmetic progression. In this paper we update a number of his computations using advances in hardware. Based on this we refine his conjecture on…

数论 · 数学 2024-04-04 Andrew Fiori

The parity of the partition function $p(n)$ remains strikingly mysterious. Beyond a handful of fragmentary results, essentially nothing is known about the distribution of parity. We prove a uniform result on quadratic progressions. If…

数论 · 数学 2025-10-06 Ken Ono

The $3k-4$ Theorem asserts that, if $A,\,B\subseteq \mathbb Z$ are finite, nonempty subsets with $|A|\geq |B|$ and $|A+B|=|A|+|B|+r< |A|+2|B|-3$, then there are arithmetic progressions $P_A$ and $P_B$ of common difference with $X\subseteq…

数论 · 数学 2024-02-26 David J. Grynkiewicz

For a permutation $z$ in the symmetric group $\mathrm{S}_{n}$, denote by $L_{z}$ the corresponding simple highest weight module in the principal block of the BGG category $\mathcal{O}$ for the Lie algebra $\mathfrak{sl}_{n}(\mathbb{C})$. In…

表示论 · 数学 2026-01-28 Samuel Creedon , Volodymyr Mazorchuk

Let the random variable $X\, :=\, e(\mathcal{H}[B])$ count the number of edges of a hypergraph $\mathcal{H}$ induced by a random $m$-element subset $B$ of its vertex set. Focussing on the case that the degrees of vertices in $\mathcal{H}$…

组合数学 · 数学 2020-12-18 Simon Griffiths , Christoph Koch , Matheus Secco

We establish unconditional $\Omega$-results for all weighted even moments of primes in arithmetic progressions. We also study the moments of these moments and establish lower bounds under GRH. Finally, under GRH and LI we prove an…

数论 · 数学 2023-06-16 Régis de la Bretèche , Daniel Fiorilli

A celebrated theorem of Delange gives a sufficient condition for an arithmetic function to be the sum of the associated Ramanujan expansion with the coefficients provided by a previous result of Wintner. By applying the Delange theorem to…

数论 · 数学 2022-04-05 Maurizio Laporta

Zaremba's Conjecture concerns the formation of continued fractions with partial quotients restricted to a given alphabet. In order to answer the numerous questions that arrive from this conjecture, it is best to consider a semi-group, often…

数论 · 数学 2021-12-03 Peter Cohen

A conjecture of Erd\H{o}s states that, for any large prime $q$, every reduced residue class $\pmod q$ can be represented as a product $p_1p_2$ of two primes $p_1,p_2\leq q$. We establish a ternary version of this conjecture, showing that,…

数论 · 数学 2024-02-16 Kaisa Matomäki , Joni Teräväinen

A permutation array $A$ is a set of permutations on a finite set $\Omega$, say of size $n$. Given distinct permutations $\pi, \sigma\in \Omega$, we let $hd(\pi, \sigma) = |\{ x\in \Omega: \pi(x) \ne \sigma(x) \}|$, called the Hamming…

组合数学 · 数学 2018-09-12 Sergey Bereg , Zevi Miller , Luis Gerardo Mojica , Linda Morales , I. H. Sudborough

We prove that the problem of reconstructing a permutation $\pi_1,\dotsc,\pi_n$ of the integers $[1\dotso n]$ given the absolute differences $|\pi_{i+1}-\pi_i|$, $i = 1,\dotsc,n-1$ is NP-complete. As an intermediate step we first prove the…

计算复杂性 · 计算机科学 2014-10-28 Marzio De Biasi

Let $\wedge$ be a lattice in $\mathbb{R}^n$ reduced in the sense of Korkine and Zolotareff having a basis of the form $(A_1,0,0,\ldots,0),(a_{2,1},A_2,0,\ldots,0)$, $\ldots,(a_{n,1},a_{n,2},\ldots,a_{n,n-1},A_n)$ where $A_1, A_2,\ldots,A_n$…

数论 · 数学 2015-01-15 Leetika Kathuria , Madhu Raka

We consider a game in which a blindfolded player attempts to set $n$ counters lying on the vertices of a rotating regular $n$-gon table simultaneously to $0$. When the counters count$\pmod{m}$ we simplify the argument of Bar Yehuda, Etzion,…

组合数学 · 数学 2024-03-01 Samuel Korsky

We extend recent results of Ono and Raji, relating the number of self-conjugate $7$-core partitions to Hurwitz class numbers. Furthermore, we give a combinatorial explanation for the curious equality $2\operatorname{sc}_7(8n+1) =…

数论 · 数学 2021-02-16 Kathrin Bringmann , Ben Kane , Joshua Males

A conjecture of Min\'a\v{c} and T\^an predicts that for any n>2, any prime p and any field k, the Massey product of n Galois cohomology classes in H^1(k,Z/pZ) must vanish if it is defined. We establish this conjecture when k is a number…

数论 · 数学 2023-02-01 Yonatan Harpaz , Olivier Wittenberg

Let $\overline{p}(n)$ be the number of overpartitions of $n$, we establish and give a short elementary proof of the following congruence \[\overline{p}({{4}^{\alpha }}(40n+35))\equiv 0 \, (\bmod \, 40),\] where $\alpha ,n $ are nonnegative…

数论 · 数学 2014-07-22 Liuquan Wang

The Tu--Deng Conjecture is concerned with the sum of digits $w(n)$ of $n$ in base~$2$ (the Hamming weight of the binary expansion of $n$) and states the following: assume that $k$ is a positive integer and $1\leq t<2^k-1$. Then \[\Bigl…

组合数学 · 数学 2018-07-12 Lukas Spiegelhofer , Michael Wallner

Let $\mathbb{Z}_n$ denote the ring of integers modulo $n$. In this paper we consider two extremal problems on permutations of $\mathbb{Z}_n$, namely, the maximum size of a collection of permutations such that the sum of any two distinct…

组合数学 · 数学 2014-02-18 L. Sunil Chandran , Deepak Rajendraprasad , Nitin Singh