Related papers: Graphs of Vectorial Plateaued Functions as Differe…
In this article a procedure to construct bent functions from $\F_{p^n}$ to $\F_p$ by merging plateaued functions which are bent on ($n-2$)-dimensional subspaces of $\F_{p^n}$ is presented. Taking advantage of such classes of plateaued…
We study partial fraction decompositions (PFDs) in several variables using tools from commutative algebra. We give criteria for when a rational function with poles on a hyperplane arrangement has a desirable PFD. Our criteria are obtained…
We study the complexity classes P and NP through a semigroup fP ("polynomial-time functions"), consisting of all polynomially balanced polynomial-time computable partial functions. Then P is not equal to NP iff fP is a non-regular…
An odd meromorphic function f(s) is constructed from the Riemann zeta-function evaluated at one-half plus s. The partial fraction expansion, p(s), of f(s) is obtained using the conjunction of the Riemann hypothesis and hypotheses advanced…
We show that the graph of a bent function is a Salem set in an appropriate sense. We also establish a simple result that quantifies redundancies in the difference operators of a function, which applies to bent functions over fields of odd…
This work highlights the existence of partial symmetries in large families of iterated plethystic coefficients. The plethystic coefficients involved come from the expansion in the Schur basis of iterated plethysms of Schur functions indexed…
Factorable surfaces, i.e. graphs associated with the product of two functions of one variable, constitute a wide class of surfaces. Such surfaces in the pseudo-Galilean space with zero Gaussian and mean curvature were obtained in [1]. In…
We classify the 3-point functions of local gauge-invariant single-trace operators in the scalar sector of planar N=4 supersymmetric Yang-Mills involving at least one su(3) operator. In the case of two su(3) and one su(2) operators, the…
Functions with uniform level sets can represent orders, preference relations or other binary relations and thus turn out to be a tool for scalarization that can be used, e.g., in multicriteria optimization, decision theory, mathematical…
We study graph parameters whose associated edge-connection matrices have exponentially bounded rank growth. Our main result is an explicit construction of a large class of graph parameters with this property that we call mixed partition…
Much work has been devoted to bent functions in odd characteristic, but there still remains a gap between our knowledge of binary and nonbinary bent functions. In the first part of this paper, we attempt to partially bridge this gap by…
In this paper, we construct a partial group \(\mathcal{P}(F)\) that represents the "partial symmetry" inherent in a subset \(F\) of \(d\)-dimensional Euclidean space. In cases where \(F\) is not connected, \(\mathcal{P}(F)\) captures more…
Factorial Schur functions are generalizations of Schur functions that have, in addition to the usual variables, a second family of "shift" parameters. We show that a factorial Schur function times a deformation of the Weyl denominator may…
By a "generalized Calabi-Yau hypersurface" we mean a hypersurface in ${\mathbb P}^n$ of degree $d$ dividing $n+1$. The zeta function of a generic such hypersurface has a reciprocal root distinguished by minimal $p$-divisibility. We study…
Spectral functions of symmetric matrices -- those depending on matrices only through their eigenvalues -- appear often in optimization. A cornerstone variational analytic tool for studying such functions is a formula relating their…
A well known theorem due to Kasteleyn states that the partition function of an Ising model on an arbitrary planar graph can be represented as the Pfaffian of a skew-symmetric matrix associated to the graph. This results both embodies the…
For a function $f$ from $\mathbb{F}_2^n$ to $\mathbb{F}_2^n$, the planarity of $f$ is usually measured by its differential uniformity and differential spectrum. In this paper, we propose the concept of vanishing flats, which supplies a…
A permutation of length $n$ is called a flattened partition if the leading terms of maximal chains of ascents (called runs) are in increasing order. We analogously define flattened parking functions: a subset of parking functions for which…
Motivated by applications for set containment problems, we consider the following fundamental problem: can we design set-to-vector functions so that the natural partial order on sets is preserved, namely $S\subseteq T \text{ if and only if…
We introduce non-commutative algebras, which can be associated with the function algebra of functions on a finite or half-finite cylinder. The algebras, which depend on a deformation parameter, are crossed product algebras of a partial…