English
Related papers

Related papers: Gold Functions and Switched Cube Functions Are Not…

200 papers

Gromov conjectured that any irreducible lattice in a symmetric space of rank at least 3 should have at most polynomial Dehn function. We prove that the lattice Sp(2p;Z) has quadratic Dehn function when p is at least 5. By results of…

Group Theory · Mathematics 2014-05-26 David Bruce Cohen

A (4,5,6)-fullerene is a plane cubic graph whose faces are only quadrilaterals, pentagons and hexagons, which includes all (4,6)- and (5,6)-fullerenes. A connected graph $G$ with at least $2k+2$ vertices is $k$-extendable if $G$ has perfect…

Combinatorics · Mathematics 2025-01-13 Lifang Zhao , Heping Zhang

Functions with low differential uniformity have relevant applications in cryptography. Recently, functions with low $c$-differential uniformity attracted lots of attention. In particular, so-called APcN and PcN functions (generalization of…

Combinatorics · Mathematics 2021-02-05 Daniele Bartoli , Marco Calderini

We prove that the Fourier dimension of any Boolean function with Fourier sparsity $s$ is at most $O\left(s^{2/3}\right)$. Our proof method yields an improved bound of $\widetilde{O}(\sqrt{s})$ assuming a conjecture of…

Computational Complexity · Computer Science 2014-07-15 Swagato Sanyal

Cyclic codes, as linear block error-correcting codes in coding theory, play a vital role and have wide applications. Ding in \cite{D} constructed a number of classes of cyclic codes from almost perfect nonlinear (APN) functions and planar…

Information Theory · Computer Science 2013-06-03 Chunming Tang , Yanfeng Qi , Maozhi Xu

In studying the expressiveness of neural networks, an important question is whether there are functions which can only be approximated by sufficiently deep networks, assuming their size is bounded. However, for constant depths, existing…

Machine Learning · Computer Science 2020-12-29 Gal Vardi , Ohad Shamir

We prove that every connected cubic graph with $n$ vertices has a maximal matching of size at most $\frac{5}{12} n+ \frac{1}{2}$. This confirms the cubic case of a conjecture of Baste, F\"urst, Henning, Mohr and Rautenbach (2019) on regular…

Combinatorics · Mathematics 2021-08-10 Wouter Cames van Batenburg

In this paper we continue the investigations about unlike powers in arithmetic progression. We provide sharp upper bounds for the length of primitive non-constant arithmetic progressions consisting of squares/cubes and $n$-th powers.

Number Theory · Mathematics 2007-07-05 Lajos Hajdu , Szabolcs Tengely

The logarithm of the number of binary n-variable bent functions is asymptotically less than $11(2^n)/32$ as n tends to infinity. Keywords: boolean function, Walsh--Hadamard transform, plateaued function, bent function, upper bound

Information Theory · Computer Science 2024-11-19 Vladimir N. Potapov

We consider supersymmetric PP-wave limits for different N=1 orbifold geometries of the five sphere S^5 and the five dimensional Einstein manifold T^{1,1}. As there are several interesting ways to take the Penrose limits, the PP-wave…

High Energy Physics - Theory · Physics 2016-09-06 Kyungho Oh , Radu Tatar

We define zeta functions for the adjoint action of GL(n) on its Lie algebra and study their analytic properties. For n<4 we are able to fully analyse these functions, and recover the Shintani zeta function for the prehomogeneous vector…

Number Theory · Mathematics 2013-08-27 Jasmin Matz

The concept of metric dimension has applications in a variety of fields, such as chemistry, robotic navigation, and combinatorial optimization. We show bounds for graphs with $n$ vertices and metric dimension $\beta$. For Hamiltonian…

Combinatorics · Mathematics 2017-04-14 Carl Joshua Quines , Michael Sun

We consider the problem of extending functions \phi:\to S^n to functions u:B^{n+1}\to S^n for n=2,3. We assume \phi to belong to the critical space W^{1,n} and we construct a W^{1,(n+1,\infty)}-controlled extension u. The Lorentz-Sobolev…

Functional Analysis · Mathematics 2016-01-20 Mircea Petrache , Tristan Rivière

The investigation of partially APN functions has attracted a lot of research interest recently. In this paper, we present several new infinite classes of 0-APN power functions over $\mathbb{F}_{2^n}$ by using the multivariate method and…

Information Theory · Computer Science 2022-12-12 Yuying Man , Shizhu Tian , Nian Li , Xiangyong Zeng

Let M denote the maximal function along the polynomial curve p(t)=(t,t^2,...,t^d) in R^d: M(f)=sup_{r>0} (1/2r) \int_{|t|<r} |f(x-p(t))| dt. We show that the L^2-norm of this operator grows at most logarithmically with the parameter d:…

Classical Analysis and ODEs · Mathematics 2013-10-14 Ioannis Parissis

In partial function extension, we are given a partial function consisting of $n$ points from a domain and a function value at each point. Our objective is to determine if this partial function can be extended to a function defined on the…

Data Structures and Algorithms · Computer Science 2018-12-17 Umang Bhaskar , Gunjan Kumar

A class of subharmonic functions represented by the modified kernels are proved to have the growth estimates u(x) =o(x_{n}^{1-alpha}|x|^{m+alpha})at infinity in the upper half space of Rn, which generalizes the growth properties of analytic…

Functional Analysis · Mathematics 2008-11-14 Pan Guoshuang , Deng Guantie

We investigate the max min of the algebraic degree and the nonlinearity of a Boolean function in $n$ variables when restricted to a $k$-dimensional affine subspace of $\mathbb{F}_2^n$. Previous authors have focused on the cases when the max…

Combinatorics · Mathematics 2025-03-03 Jan Kristian Haugland

We study projective dimension, a graph parameter (denoted by pd$(G)$ for a graph $G$), introduced by (Pudl\'ak, R\"odl 1992), who showed that proving lower bounds for pd$(G_f)$ for bipartite graphs $G_f$ associated with a Boolean function…

Computational Complexity · Computer Science 2020-01-10 Krishnamoorthy Dinesh , Sajin Koroth , Jayalal Sarma

We improve the $L^p(\mathbb{R}^n)$ bounds on Stein's square function to the best-known range of the Fourier restriction problem when $n\geq4$. Applications including certain local smoothing estimates are also discussed.

Classical Analysis and ODEs · Mathematics 2021-09-15 Shengwen Gan , Changkeun Oh , Shukun Wu