Related papers: Weightwise perfectly balanced functions with high …
Boundary analysis is developed for a rich class of generally infinite weighted graphs with compact metric completions. These graph completions have totally disconnected boundaries. The classical notion of $\epsilon$-components and the…
A Boolean function on n variables is q-resilient if for any subset of at most q variables, the function is very likely to be determined by a uniformly random assignment to the remaining n-q variables; in other words, no coalition of at most…
In this paper, we are concerned with the shallow water flow model over non-flat bottom topography by high-order schemes. Most of the numerical schemes in the literature are developed from the original mathematical model of the shallow water…
Differentially 4-uniform permutations on $\gf_{2^{2k}}$ with high nonlinearity are often chosen as Substitution boxes in both block and stream ciphers. Recently, Qu et al. introduced a class of functions, which are called preferred…
The weighted-Hamming metric generalizes the Hamming metric by assigning different weights to blocks of coordinates. It is well-suited for applications such as coding over independent parallel channels, each of which has a different level of…
We study the non-diffusive Westervelt equation in the weakly nonlinear regime. We show that the leading profile equation is of Burgers' type. We show that a compactly supported nonlinearity $\alpha$ can be reconstructed from the tilt of the…
In this paper, we further extend the study of function-correcting codes in the homogeneous metric over a chain ring $\mathbb{Z}_{2^s}$ for broader classes of functions, namely, locally bounded functions and linear functions, and for weight…
We determine a connection between the weight of a Boolean function and the total weight of its first-order derivatives. The relationship established is used to study some cryptographic properties of Boolean functions. We establish a…
Rotation symmetric Boolean functions represent an interesting class of Boolean functions as they are relatively rare compared to general Boolean functions. At the same time, the functions in this class can have excellent properties, making…
We present a scalable approach to computing nonlinear balancing energy functions for control-affine systems with polynomial nonlinearities. Al'brekht's power-series method is used to solve the Hamilton-Jacobi-Bellman equations for…
We prove weighted strong inequalities for the multilinear potential operator ${\cal T}_{\phi}$ and its commutator, where the kernel $\phi$ satisfies certain growth condition. For these operators we also obtain Fefferman-Stein type…
We answer a question from A. V. Abanin and P. T. Tien about so-called almost subadditive weight functions in the sense of Braun-Meise-Taylor. Using recent knowledge of a growth index for functions, crucially appearing in the…
Round functions used as building blocks for iterated block ciphers, both in the case of Substitution-Permutation Networks and Feistel Networks, are often obtained as the composition of different layers which provide confusion and diffusion,…
The dynamics of quantum systems under the adiabatic Hamiltonian has attracted attention not only in quantum control but also in a wide range of fields from condensed matter physics to high-energy physics because of its non-perturbative…
We associate a weight function to pairs consisting of a smooth and proper variety X over a complete discretely valued field and a differential form on X of maximal degree. This weight function is a real-valued function on the…
Safety filters based on control barrier functions (CBFs) and high-order control barrier functions (HOCBFs) are often implemented through quadratic programs (QPs). In general, especially in the presence of multiple constraints, feasibility…
Cyclic codes are a subclass of linear codes and have applications in consumer electronics, data storage systems, and communication systems as they have efficient encoding and decoding algorithms. In this paper, almost perfect nonlinear…
Simulation-based verification algorithms can provide formal safety guarantees for nonlinear and hybrid systems. The previous algorithms rely on user provided model annotations called discrepancy function, which are crucial for computing…
The characterization and construction of bent functions are challenging problems. The paper generalizes the constructions of Boolean bent functions by Mesnager \cite{M2014}, Xu et al. \cite{XCX2015} and $p$-ary bent functions by Xu et al.…
Function-Correcting Codes (FCCs) enable reliable computation of a function of a $k$-bit message over noisy channels without requiring full message recovery. In this work, we study optimal single-error correcting FCCs (SEFCCs) for…