English
Related papers

Related papers: Non Abelian Bent Functions

200 papers

We say that an algebraic group $G$ over a field is anti-affine if every regular function on $G$ is constant. We obtain a classification of these groups, with applications to the structure of algebraic groups in positive characteristics, and…

Algebraic Geometry · Mathematics 2008-06-25 Michel Brion

A set of quasi-uniform random variables $X_1,...,X_n$ may be generated from a finite group $G$ and $n$ of its subgroups, with the corresponding entropic vector depending on the subgroup structure of $G$. It is known that the set of entropic…

Group Theory · Mathematics 2012-12-11 Eldho K. Thomas , Nadya Markin , Frédérique Oggier

Let $G$ and $H$ be groups that act compatibly on each other. We denote by $[G,H]$ the derivative subgroup of $G$ under $H$. We prove that if the set $\{g^{-1}g^h \mid g \in G, h \in H\}$ has $m$ elements, then the derivative $[G,H]$ is…

Group Theory · Mathematics 2018-12-13 Raimundo Bastos , Irene N. Nakaoka , Noraí R. Rocco

In 2007, Carlet and Ding introduced two parameters, denoted by $Nb_F$ and $NB_F$, quantifying respectively the balancedness of general functions $F$ between finite Abelian groups and the (global) balancedness of their derivatives $D_a…

Information Theory · Computer Science 2023-05-11 Shihui Fu , Xiutao Feng , Qiang Wang , Claude Carlet

This paper is concerned with the topological space of normalized quaternion-valued positive definite functions on an arbitrary abelian group G, especially its convex characteristics. There are two main results. Firstly, we prove that the…

Representation Theory · Mathematics 2024-12-10 Zeping Zhu

It is well-known that degree two finite field extensions can be equipped with a Hermitian-like structure similar to the extension of the complex field over the reals. In this contribution, using this structure, we develop a modular…

Cryptography and Security · Computer Science 2013-04-23 Laurent Poinsot

In this paper, we explore Fourier analysis for noncommutative $L_p$ space-valued functions on $G$, where $G$ is a totally disconnected non-abelian compact group. By additionally assuming that the value of these functions remains invariant…

Functional Analysis · Mathematics 2024-03-15 Fugui Ding , Guixiang Hong , Xumin Wang

For a semisimple real Lie group $G$ with an irreducible representation $\rho$ on a finite-dimensional real vector space $V$, we give a sufficient criterion on $\rho$ for existence of a group of affine transformations of $V$ whose linear…

Group Theory · Mathematics 2018-10-01 Ilia Smilga

We observe that for a large class of non-amenable groups $G$, one can find bounded representations of $A(G)$ on Hilbert space which are not completely bounded. We also consider restriction algebras obtained from $A(G)$, equipped with the…

Functional Analysis · Mathematics 2013-04-19 Yemon Choi , Ebrahim Samei

In a recent survey, Schmidt compiled equivalences between generalized bent functions, group invariant Butson Hadamard matrices, and abelian splitting relative difference sets. We establish a broader network of equivalences by considering…

Combinatorics · Mathematics 2022-07-13 José Andrés Armario , Ronan Egan , Dane Flannery

Let p be a prime. A p-adic functional on a torsion-free abelian group G is a group homomorphism from G to the p-adic integers. The group of all such p-adic functionals is viewed as a p-adic dual group of G, and is studied from the point of…

Group Theory · Mathematics 2016-08-10 Gregory R. Maloney

We say a group is finitely annihilated if it is the set-theoretic union of all its proper normal finite index subgroups. We investigate this new property, and observe that it is independent of several other well known group properties. For…

Group Theory · Mathematics 2019-02-20 Maurice Chiodo

For each non-constant Boolean function $q$, Klapper introduced the notion of $q$-transforms of Boolean functions. The {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable…

Combinatorics · Mathematics 2019-05-02 Zhixiong Chen , Andrew Klapper

Let $G$ be a finite group acting on $\mathbb{C}^N$. We study the problem of identifyng the class in $\mathbb{C}^N / G$ of a given signal: this encompasses several types of problems in signal processing. Some instances include certain…

Functional Analysis · Mathematics 2019-11-15 Jameson Cahill , Andres Contreras , Andres Contreras Hip

In the paper we introduce a new family of "small" sets which is tightly connected with two well known $\sigma$-ideals: of Haar-null sets and of Haar-meager sets. We define a subset $A$ of a topological group $X$ to be…

General Topology · Mathematics 2021-11-01 Taras Banakh , Eliza Jabłońska

A group is called metahamiltonian if all non-abelian subgroups of it are normal. This concept is a natural generalization of Hamiltonian groups. In this paper, the properties of finite metahamiltonian $p$-groups are investigated.

Group Theory · Mathematics 2014-10-23 Lijian An , Qinhai Zhang

In this paper, two new classes of perfect nonlinear functions over $\mathbb{F}_{p^{2m}}$ are proposed, where $p$ is an odd prime. Furthermore, we investigate the nucleus of the corresponding semifields of these functions and show that the…

Information Theory · Computer Science 2019-05-09 Jinquan Luo , Junru Ma

For each non-constant $q$ in the set of $n$-variable Boolean functions, the {\em $q$-transform} of a Boolean function $f$ is related to the Hamming distances from $f$ to the functions obtainable from $q$ by nonsingular linear change of…

Cryptography and Security · Computer Science 2017-11-09 Zhixiong Chen , Ting Gu , Andrew Klapper

A gain graph is a triple (G,h,H), where G is a connected graph with an arbitrary, but fixed, orientation of edges, H is a group, and h is a homomorphism from the free group on the edges of G to H. A gain graph is called balanced if the…

Combinatorics · Mathematics 2010-01-24 Konstantin Rybnikov , Thomas Zaslavsky

We study Fourier-sparse Boolean functions over general finite Abelian groups. A Boolean function $f : G \to \{-1,+1\}$ is $s$-sparse if it has at most $s$ non-zero Fourier coefficients. We introduce a general notion of granularity of…

Computational Complexity · Computer Science 2026-02-03 Sourav Chakraborty , Swarnalipa Datta , Pranjal Dutta , Arijit Ghosh , Swagato Sanyal