Let G be a simply connected simple Lie group over C. Let N± be the positive and the negative maximal unipotent subgroups, and H the maximal torus, corresponding to some polarization of G. Let G0 = N−HN+ be the big Bruhat cell. Let χ± : N± → C be holomorphic nondegenerate characters (i.e. they don’t vanish on simple roots). A Whittaker function on G0 with characters χ+, χ− is any holomorphic fun...

Bent functions have maximal minimum distance to the set of affine functions. In other words, they achieve the maximal minimum distance to all the coordinate functions of affine monomials. In this paper we introduce a new class of bent functions which we call hyper-bent functions. Functions within this class achieve the maximal minimum distance to all the coordinate functions of all bijective mo...

We exhibit Cartwright-Curien-Felleisen’s model of observably sequential algorithms as a full subcategory of Laird’s bistable biorders, thereby reconciling two views of functions: functions-as-algorithms (or programs), and functions-as-relations. We then characterize affine sequential algorithms as affine bistable functions in the full subcategory of locally boolean orders.