English
Related papers

Related papers: The resolution of Niho's last conjecture concernin…

200 papers

Let $\mathbb{F}_q$ be a prime field with $q \geq 3$, and let $d, m \geq 1$ be integers such that $\gcd \left( d, q \right) = 1$ and $m \mid (q - 1)$. In this paper we bound the absolute values of the Walsh spectrum of S-Boxes $S (x) = x^d…

Number Theory · Mathematics 2025-10-14 Matthias Johann Steiner

Let $q=2^e$ with $e$ even, and let $\mathbb{F}_{q^2}$ be the finite field of order $q^2$. Put $d=(q^2+q+1)/3$, and consider the permutation polynomial $$\sigma(X)=X+X^d+X^{dq}\in\mathbb{F}_{q^2}[X].$$ For $\alpha\in\mathbb{F}_q^*$, define…

Number Theory · Mathematics 2026-03-31 Kaimin Cheng

The amplitudes for $2\rightarrow 2$ scattering processes involving longitudinally polarized gauge bosons $( W_L^\pm, Z_L )$ and the Higgs boson are analyzed up to two loops. Assuming $M_H >> M_W$, the trilinear Higgs coupling, $\lambda v$,…

High Energy Physics - Phenomenology · Physics 2011-08-17 Kurt Riesselmann

We determine the weight spectra of the Reed-Muller codes $RM(m-3,m)$ for $m\ge 6$ and $RM(m-4,m)$ for $m\ge 8$. The technique used is induction on $m$, using that the sum of two weights in $RM(r-1,m-1)$ is a weight in $RM(r,m)$, and using…

Information Theory · Computer Science 2023-07-06 Claude Carlet , Patrick Solé

For each odd $m \geq 3$ we completely solve the problem of when an $m$-cycle system of order $u$ can be embedded in an $m$-cycle system of order $v$, barring a finite number of possible exceptions. In cases where $u$ is large compared to…

Combinatorics · Mathematics 2015-06-15 Daniel Horsley , Rosalind A. Hoyte

We study the sequences generated by neuronal recurrence equations of the form $x(n) = {\bf 1}[\sum_{j=1}^{h} a_{j} x(n-j)- \theta]$. From a neuronal recurrence equation of memory size $h$ which describes a cycle of length $\rho(m) \times…

Neural and Evolutionary Computing · Computer Science 2012-04-10 René Ndoundam

Power decoding, or "decoding by virtual interleaving", of Reed--Solomon codes is a method for unique decoding beyond half the minimum distance. We give a new variant of the Power decoding scheme, building upon the key equation of Gao. We…

Information Theory · Computer Science 2014-05-22 Johan S. R. Nielsen

We prove a conjecture of Helleseth that claims that for any $n \geq 0$, a pair of binary maximal linear sequences of period $2^{2^n}-1$ can not have a three-valued cross-correlation function.

Combinatorics · Mathematics 2011-10-31 Daniel J. Katz

We present an update of the light meson spectrum with $N_f$=2+1 overlap fermions on a $16^3\times 48$ lattice at five different up and down quark masses and two strange quark masses. Based on our experience with the previous simulation with…

High Energy Physics - Lattice · Physics 2012-08-27 JLQCD , TWQCD Collaborations , : , J. Noaki , S. Aoki , T. W. Chiu , H. Fukaya , S. Hashimoto , T. H. Hsieh , T. Kaneko , H. Matsufuru , T. Onogi , E. Shintani , N. Yamada

It is conjectured that for every pair $(\ell,m)$ of odd integers greater than 2 with $m \equiv 1\; \pmod{\ell}$, there exists a cyclic two-factorization of $K_{\ell m}$ having exactly $(m-1)/2$ factors of type $\ell^m$ and all the others of…

Combinatorics · Mathematics 2016-04-01 Francesca Merola , Tommaso Traetta

Cyclic codes of dimension $2$ over a finite field are shown to have at most two nonzero weights. This extends a construction of Rao et al (2010) and disproves a conjecture of Schmidt-White (2002). We compute their weight distribution, and…

Information Theory · Computer Science 2017-09-19 Minjia Shi , Zhongyi Zhang , Patrick Sole

Let $\mathcal T (n, k)$ be the set of the $k$-uniform supertrees with $n$ vertices and $m$ edges, where $k\geq 3$, $n\geq 5$ and $m=\frac{n-1}{k-1}$. % Let $m$ be the number of the edges of the supertrees in $\mathcal T (n, k)$, where…

Combinatorics · Mathematics 2023-08-02 Lou-Jun Yu , Wen-Huan Wang

We study the shifted convolution sums associated to completely multiplicative functions taking values in $\{\pm 1\}$ and give combinatorical proofs of two recent results in the direction of Chowla's conjecture. We also determine the…

Number Theory · Mathematics 2025-03-11 Krishnarjun Krishnamoorthy

In this paper, we completely determine the number of solutions to $ \operatorname{Tr}^{q^2}_q(bx+b)+c=0, x\in \mu_{q+1}\backslash \{-1\}$ for all $b\in \mathbb{F}_{q^2}, c\in\mathbb{F}_{q}$. As an application, we can give the weight…

Information Theory · Computer Science 2023-04-11 Wei Lu , Xia Wu

Let $(G_n(x))_{n=0}^\infty$ be a $d$-th order linear recurrence sequence having polynomial characteristic roots, one of which has degree strictly greater than the others. Moreover, let $m\geq 2$ be a given integer. We ask for…

Number Theory · Mathematics 2018-10-30 Clemens Fuchs , Christina Karolus

The optical properties of a multilayer system of dielectric media with arbitrary $N$ layers is investigated. Each layer is one of two dielectric media, with thickness one-quarter the wavelength of light in that medium, corresponding to a…

Optics · Physics 2017-10-25 Haihao Liu , M. Shoufie Ukhtary , Riichiro Saito

We suggest an upper bound on binomial coefficients that holds over the entire parameter range and whose form repeats the form of the de Moivre-Laplace approximation of the symmetric binomial distribution. Using the bound, we estimate the…

Combinatorics · Mathematics 2022-05-17 Sergey Agievich

We prove that any pair of bivariate trinomials has at most 5 isolated roots in the positive quadrant. The best previous upper bounds independent of the polynomial degrees were much larger, e.g., 248832 (for just the non-degenerate roots)…

Algebraic Geometry · Mathematics 2007-05-23 Tien-Yien Li , J. Maurice Rojas , Xiaoshen Wang

We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…

Combinatorics · Mathematics 2024-10-28 Miklos Bona , Boris Pittel

In this paper we adapt techniques used by Ahlswede and Khachatrian in their proof of the Complete Erd\H{o}s-Ko-Rado Theorem to show that if $n \geq 2t+1$, then any pairwise $t$-cycle-intersecting family of permutations has cardinality less…

Combinatorics · Mathematics 2013-03-05 Karen Meagher , Alison Purdy