English
Related papers

Related papers: P$\wp$N functions, complete mappings and quasigrou…

200 papers

A permutation P on {1,..,N} is a_fast_forward_permutation_ if for each m the computational complexity of evaluating P^m(x)$ is small independently of m and x. Naor and Reingold constructed fast forward pseudorandom cycluses and involutions.…

Cryptography and Security · Computer Science 2010-11-02 Boaz Tsaban

Perfect nonlinear functions from a finite group $G$ to another one $H$ are those functions $f: G \rightarrow H$ such that for all nonzero $\alpha \in G$, the derivative $d_{\alpha}f: x \mapsto f(\alpha x) f(x)^{-1}$ is balanced. In the case…

Cryptography and Security · Computer Science 2010-12-22 Laurent Poinsot

For a generalized permutohedron $Q$ the enumerator $F(Q)$ of positive lattice points in interiors of maximal cones of the normal fan $\Sigma_Q$ is a quasisymmetric function. We describe this function for the class of nestohedra as a Hopf…

Combinatorics · Mathematics 2017-05-18 Vladimir Grujić

Let $k$ be an algebraically closed field of characteristic $p>0$, let $R$ be a commutative ring, and let $\mathbb{F}$ be an algebraically closed field of characteristic 0. We consider the $R$-linear category $\mathcal{F}^\Delta_{Rpp_k}$ of…

Group Theory · Mathematics 2022-02-01 Serge Bouc , Deniz Yılmaz

Let $p$ be an odd prime number. We prove that for $m\equiv1\mod p$, $x^m$ is perfectly nonlinear over $\mathbb{F}_{p^n}$ for infinitely many $n$ if and only if $m$ is of the form $p^l+1$, $l\in\mathbb{N}$. First, we study singularities of…

Number Theory · Mathematics 2012-05-04 Elodie Leducq

In an undirected graph $G=(V,E)$, we say $(A,B)$ is a pair of perfectly matched sets if $A$ and $B$ are disjoint subsets of $V$ and every vertex in $A$ (resp. $B$) has exactly one neighbor in $B$ (resp. $A$). The size of a pair of perfectly…

Discrete Mathematics · Computer Science 2022-11-08 N. R. Aravind , Roopam Saxena

Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $\epsilon$-balanced if its…

Combinatorics · Mathematics 2007-05-23 Joshua N. Cooper

Let $f={\tt X}^r(a+{\tt X}^{2(q-1)})\in{\Bbb F}_{q^2}[{\tt X}]$, where $a\in{\Bbb F}_{q^2}^*$ and $r\ge 1$. The parameters $(q,r,a)$ for which $f$ is a permutation polynomial (PP) of ${\Bbb F}_{q^2}$ have been determined in the following…

Combinatorics · Mathematics 2016-09-14 Xiang-dong Hou

Let $G$ be a finite abelian group acting faithfully on a finite set $X$. As a natural generalization of the perfect nonlinearity of Boolean functions, the $G$-bentness and $G$-perfect nonlinearity of functions on $X$ are studied by Poinsot…

Discrete Mathematics · Computer Science 2014-06-18 Yun Fan , Bangteng Xu

In the context of generating functions for $P$-partitions, we revisit three flavors of quasisymmetric functions: Gessel's quasisymmetric functions, Chow's type B quasisymmetric functions, and Poirier's signed quasisymmetric functions. In…

Combinatorics · Mathematics 2007-05-23 T. Kyle Petersen

Given a set of permutations Pi, let S_n(Pi) denote the set of permutations in the symmetric group S_n that avoid every element of Pi in the sense of pattern avoidance. Given a subset S of {1,...,n-1}, let F_S be the fundamental…

Combinatorics · Mathematics 2018-12-18 Zachary Hamaker , Brendan Pawlowski , Bruce Sagan

We show that every $(2^n,2^n,2^n,1)$-relative difference set $D$ in $\Z_4^n$ relative to $\Z_2^n$ can be represented by a polynomial $f(x)\in \F_{2^n}[x]$, where $f(x+a)+f(x)+xa$ is a permutation for each nonzero $a$. We call such an $f$ a…

Combinatorics · Mathematics 2013-04-16 Yue Zhou

For two meromorphic functions $ f $ and $ g $, the equation $ f^m+g^m=1 $ can be regarded as Fermat-type equations. Using Nevanlinna theory for meromorphic functions in several complex variables, the main purpose of this paper is to…

Complex Variables · Mathematics 2022-01-26 Goutam Haldar

Let S_n be the nth symmetric group. Given a set of permutations Pi we denote by S_n(Pi) the set of permutations in S_n which avoid Pi in the sense of pattern avoidance. Consider the generating function Q_n(Pi) = sum_pi F_{Des pi} where the…

Combinatorics · Mathematics 2018-12-31 Jonathan Bloom , Bruce Sagan

The Wigner function provides a useful quasiprobability representation of quantum mechanics, with applications in various branches of physics. Many nice properties of the Wigner function are intimately connected with the high symmetry of the…

Quantum Physics · Physics 2016-02-03 Huangjun Zhu

Permutation polynomials (PPs) of the form $(x^{q} -x + c)^{\frac{q^2 -1}{3}+1} +x$ over $\mathbb{F}_{q^2}$ were presented by Li, Helleseth and Tang [Finite Fields Appl. 22 (2013) 16--23]. More recently, we have constructed PPs of the form…

Number Theory · Mathematics 2018-12-20 Yanbin Zheng , Pingzhi Yuan , Dingyi Pei

We study the polynomial approximation of symmetric multivariate functions and of multi-set functions. Specifically, we consider $f(x_1, \dots, x_N)$, where $x_i \in \mathbb{R}^d$, and $f$ is invariant under permutations of its $N$…

Numerical Analysis · Mathematics 2023-02-06 Markus Bachmayr , Geneviève Dusson , Christoph Ortner , Jack Thomas

This paper presents a noncommutative theory of symmetric functions, based on the notion of quasi-determinant. We begin with a formal theory, corresponding to the case of symmetric functions in an infinite number of independent variables.…

High Energy Physics - Theory · Physics 2008-02-03 Israel Gelfand , D. Krob , Alain Lascoux , B. Leclerc , V. S. Retakh , J. -Y. Thibon

Function graphs are graphs representable by intersections of continuous real-valued functions on the interval [0,1] and are known to be exactly the complements of comparability graphs. As such they are recognizable in polynomial time.…

Data Structures and Algorithms · Computer Science 2012-05-01 Pavel Klavík , Jan Kratochvíl , Tomasz Krawczyk , Bartosz Walczak

In this paper, we propose two new tests for testing the equality of the covariance functions of several functional populations, namely a quasi GPF test and a quasi $F_{\max}$ test. The asymptotic random expressions of the two tests under…

Methodology · Statistics 2016-09-15 Jia Guo , Jin-Ting Zhang