English
Related papers

Related papers: Classifying bent functions by their Cayley graphs

200 papers

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…

Combinatorics · Mathematics 2026-01-19 Boštjan Kuzman , Primož Šparl

In this paper we consider further applications of $(n,m)$-functions for the construction of 2-designs. For instance, we provide a new application of the extended Assmus-Mattson theorem, by showing that linear codes of APN functions with the…

Information Theory · Computer Science 2023-05-11 Wilfried Meidl , Alexandr A. Polujan , Alexander Pott

In this paper we show how the superquadratic functions can be used as a tool for researching other types of convex functions like $\phi $-convexity, strong-convexity and uniform convexity. We show how to use inequalities satisfied by…

Functional Analysis · Mathematics 2024-08-15 Shoshana Abramovich

In this note we investigate the inclusion relationship between the class of strongly starlike functions of order alpha and type beta and the class of strongly convex functions of order alpha and type beta which are subclass of normalized…

Complex Variables · Mathematics 2009-11-24 Ikkei Hotta , Mamoru Nunokawa

Cardinal functions provide valuable insight into the topological properties of spaces, helping to analyze and compare spaces in terms of their covering, convergence and separation properties. This paper focuses on investigating cardinal…

General Topology · Mathematics 2024-12-04 Sanjay Mishra , Chander Mohan Bishnoi

In the BFA 2023 conference paper, A. Polujan, L. Mariot and S. Picek exhibited the first example of a non-normal but weakly normal bent function in dimension 8. In this note, we present numerical approaches based on the classification of…

Discrete Mathematics · Computer Science 2024-07-23 Valérie Gillot , Philippe Langevin , Alexandr Polujan

In this paper, we overview one promising avenue of progress at the mathematical foundation of deep learning: the connection between deep networks and function approximation by affine splines (continuous piecewise linear functions in…

Machine Learning · Computer Science 2025-01-16 Randall Balestriero , Ahmed Imtiaz Humayun , Richard Baraniuk

Bent functions are maximally nonlinear Boolean functions with an even number of variables, which include a subclass of functions, the so-called hyper-bent functions whose properties are stronger than bent functions and a complete…

Information Theory · Computer Science 2024-07-03 Peng Han , Keli Pu

We extend the signal flow calculus---a compositional account of the classical signal flow graph model of computation---to encompass affine behaviour, and furnish it with a novel operational semantics. The increased expressive power allows…

Logic in Computer Science · Computer Science 2020-02-21 Filippo Bonchi , Robin Piedeleu , Pawel Sobocinski , Fabio Zanasi

In this paper, a new construction of quaternary bent functions from quaternary quadratic forms over Galois rings of characteristic 4 is proposed. Based on this construction, several new classes of quaternary bent functions are obtained, and…

Discrete Mathematics · Computer Science 2013-09-03 Baofeng Wu , Dongdai Lin

The results of computer searches for large graphs with given (small) degree and diameter are presented. The new graphs are Cayley graphs of semidirect products of cyclic groups and related groups. One fundamental use of our ``dense graphs''…

Combinatorics · Mathematics 2008-02-03 Michael J. Dinneen , Paul R. Hafner

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…

Number Theory · Mathematics 2013-10-31 Ayça Çeşmelioğlu , Wilfried Meidl

A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…

Combinatorics · Mathematics 2013-04-09 Mei Lu , Daqing Wan , Li-Ping Wang , Xiao-Dong Zhang

In this paper we prove that generalized bent (gbent) functions defined on $\mathbb{Z}_2^n$ with values in $\mathbb{Z}_{2^k}$ are regular, and find connections between the (generalized) Walsh spectrum of these functions and their components.…

Information Theory · Computer Science 2015-11-05 Thor Martinsen , Wilfried Meidl , Pantelimon Stanica

Graphical functions are special position space Feynman integrals, which can be used to calculate Feynman periods and one- or two-scale processes at high loop orders. With graphical functions, renormalization constants have been calculated…

High Energy Physics - Theory · Physics 2022-10-06 Michael Borinsky , Oliver Schnetz

We explore the relationship between convex and subharmonic functions on discrete sets. Our principal concern is to determine the setting in which a convex function is necessarily subharmonic. We initially consider the primary notions of…

Combinatorics · Mathematics 2014-06-25 Matthew Burke , Tony Perkins

In this paper we characterize (octal) bent generalized Boolean functions defined on $\BBZ_2^n$ with values in $\BBZ_8$. Moreover, we propose several constructions of such generalized bent functions for both $n$ even and $n$ odd.

Combinatorics · Mathematics 2011-03-07 Pante Stanica , Thor Martinsen

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…

Discrete Mathematics · Computer Science 2026-04-20 Claude Carlet , and Alexander Kholosha

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…

Optimization and Control · Mathematics 2016-08-11 Petra Weidner

Bent functions as optimal combinatorial objects are difficult to characterize and construct. In the literature, bent idempotents are a special class of bent functions and few constructions have been presented, which are restricted by the…

Information Theory · Computer Science 2015-08-25 Chunming Tang , Yanfeng Qi , Zhengchun Zhou , Cuiling Fan