中文
相关论文

相关论文: A direct proof of APN-ness of the Kasami functions

200 篇论文

In this paper, we prove that if $f(x)=\sum_{k=0}^n{n\choose k}a_kx^k$ is a polynomial with real zeros only, then the sequence $\{a_k\}_{k=0}^n$ satisfies the following inequalities $a_{k+1}^2(1-\sqrt{1-c_k})^2/a_k^2…

组合数学 · 数学 2020-12-08 J. J. F Guo

This paper examines level sets of functions of the form $f(x)=\sum_{n=0}^\infty \frac{r_n}{2^n}\phi(2^n x)$, where phi(x) is the distance from x to the nearest integer, and r_n equals 1 or -1 for each n. Such functions are referred to as…

经典分析与常微分方程 · 数学 2014-12-30 Pieter C. Allaart

Let $a,b$ and $n$ be positive integers with $a>b$. In this note, we prove that $$(2bn+1)(2bn+3){2bn \choose bn}\bigg|3(a-b)(3a-b){2an \choose an}{an\choose bn}.$$ This confirms a recent conjecture of Amdeberhan and Moll.

数论 · 数学 2015-02-26 Quan-Hui Yang

The representation for the sharp constant ${\rm K}_{n, p}$ in an estimate of the modulus of the $n$-th derivative of an analytic function in the upper half-plane ${\mathbb C}_+$ is considered. It is assumed that the boundary value of the…

复变函数 · 数学 2015-09-04 Gershon Kresin

About twenty years ago we wrote a paper, "Boolean Functions whose Fourier Transform is Concentrated on the First Two Levels", \cite{FKN}. In it we offered several proofs of the statement that Boolean functions $f(x_1,x_2,\dots,x_n)$, whose…

组合数学 · 数学 2021-05-10 Ehud Friedgut , GIl Kalai , Assaf Naor

We consider an infinite-to-one factor map from an irreducible shift of finite type X to a sofic shift Y. A compensation function relates equilibrium states on X to equilibrium states on Y. The p-Dini condition is given as a way of measuring…

动力系统 · 数学 2019-02-20 John Antonioli

The purpose of this paper is to investigate the distribution of zeros of entire functions which can be represented as the Fourier transforms of certain admissible kernels. The principal results bring to light the intimate connection between…

复变函数 · 数学 2014-02-24 George Csordas

A Sidon set $S$ in $\mathbb{F}_2^n$ is a set such that $x+y=z+w$ has no solutions $x,y,z,w \in S$ with $x,y,z,w$ all distinct. In this paper, we prove various results on Sidon sets by using or generalizing known cryptographic results. In…

组合数学 · 数学 2025-01-22 Darrion Thornburgh

Let B_n={x_i \cdot x_j=x_k, x_i+1=x_k: i,j,k \in {1,...,n}}. For a positive integer n, let \xi(n) denote the smallest positive integer b such that for each system S \subseteq B_n with a unique solution in positive integers x_1,...,x_n, this…

逻辑 · 数学 2017-08-21 Apoloniusz Tyszka

In a recent work by Charpin, Helleseth, and Zinoviev Kloosterman sums $K(a)$ over a finite field $\F_{2^m}$ were evaluated modulo 24 in the case $m$ odd, and the number of those $a$ giving the same value for $K(a)$ modulo 24 was given. In…

组合数学 · 数学 2008-02-16 Marko Moisio

Cakoni and Nguyen recently proposed very general conditions on the coefficients of Maxwell equations for which they established the discreteness of the set of eigenvalues of the transmission problem and studied their locations. In this…

偏微分方程分析 · 数学 2021-07-13 Jean Fornerod , Hoai-Minh Nguyen

We present a new result on the nonexistence of generalized bent functions (GBFs)from (Z/tZ)^n to Z/tZ (called type [n, t]) for a large class. Assume p is an odd prime number. By showing certain quadratic norm form equations having no…

信息论 · 计算机科学 2026-03-26 Chang Lv , Yuqing Zhu

We deeply investigate the Diophantine equation $cx^2+d^{2m+1}=2y^n$ in integers $x, y\geq 1, m\geq 0$ and $n\geq 3$, where $c$ and $d$ are given coprime positive integers such that $cd\not\equiv 3 \pmod 4$. We first solve this equation for…

数论 · 数学 2023-06-01 Azizul Hoque

In this paper, we study the diophantine equation ${{\sigma }_{2}}(n)-{{n}^{2}}=An+B$. We prove that except for finitely many computable solutions, all the solutions to this equation with $(A,B)=({{L}_{2m}},F_{2m}^{2}-1)$ are…

数论 · 数学 2014-06-24 Tianxin Cai , Liuquan Wang , Yong Zhang

We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…

组合数学 · 数学 2021-02-25 Julien Cassaigne , Sébastien Labbé , Julien Leroy

In this survey, we present five different proofs for the transcendence of Kempner's number, defined by the infinite series $\sum_{n=0}^{\infty} \frac{1}{2^{2^n}}$. We take the opportunity to mention some interesting ideas and methods that…

数论 · 数学 2013-09-20 Boris Adamczewski

The multi-variable Schmidt polynomials are defined by $$ S_n^{(r)}(x_0,\ldots,x_n):=\sum_{k=0}^n {n+k \choose 2k}^{r}{2k\choose k} x_k. $$ We prove that, for any positive integers $m$, $n$, $r$, and $\varepsilon=\pm 1$, all the coefficients…

数论 · 数学 2014-12-19 Qi-Fei Chen , Victor J. W. Guo

In this article, logarithmically complete monotonicity properties of some functions such as $\frac1{[\Gamma(x+1)]^{1/x}}$, $\frac{[{\Gamma(x+\alpha+1)}]^{1/(x+\alpha)}}{[{\Gamma(x+1)}]^{1/x}}$, $\frac{[\Gamma(x+1)]^{1/x}}{(x+1)^\alpha}$ and…

经典分析与常微分方程 · 数学 2010-08-03 Feng Qi , Bai-Ni Guo

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

数论 · 数学 2025-10-09 Thomas F. Bloom

We prove exact asymptotic expansions for the partial sums of the sequences of central binomial coefficients and Catalan numbers, $\sum_{k=0}^n \binom{2k}{k}$ and $\sum_{k=0}^n C_n$. We also obtain closed forms for the polynomials…

组合数学 · 数学 2010-01-13 Sandro Mattarei