Finite Symmetric Functions with Non-Trivial Arity Gap

Given an n-ary k-valued function f, gap(f) denotes the essential arity gap of f which is the minimal number of essential variables in f which become fictive when identifying any two distinct essential variables in f. In the present paper we study the properties of the symmetric function with non-trivial arity gap (2 ≤ gap(f)). We prove several results concerning decomposition of the symmetric functions with non-trivial arity gap with its minors or subfunctions. We show that all non-empty sets of essential variables in symmetric functions with non-trivial arity gap are separable. ACM Computing Classification System (1998): G.2.0.

Determination of symmetric VL1 formulas : algorithm and program SYM4 /

Mode of access: Internet.

Some new symmetric function tables.

"Reprinted from the Transactions of the Royal Society of Canada, 3d ser., 1908-1909, v.2, sect.3."

Integral formulae for a Riemannian manifold with a distribution

We obtain a new series of integral formulae for symmetric functions of curvature of a distribution of arbitrary codimension (an its orthogonal complement) given on a compact Riemannian manifold, which start from known formula by P.Walczak (1990) and generalize ones for foliations by several authors: Asimov (1978), Brito, Langevin and Rosenberg (1981), Brito and Naveira (2000), Andrzejewski and Walczak (2010), etc. Our integral formulae involve the co-nullity tensor, certain component of the curvature tensor and their products. The formulae also deal with a number of arbitrary functions depending on the scalar invariants of the co-nullity tensor. For foliated manifolds of constant curvature the obtained formulae give us the classical type formulae. For a special choice of functions our formulae reduce to ones with Newton transformations of the co-nullity tensor.

The plethysm technique applied to the classification of nuclear states

A short summary of the theory of symmetric group and symmetric functions needed to follow the theory of Schur functions and plethysms is presented. One then defines plethysm, gives its properties and presents a procedure for its calculation. Finally, some aplications in atomic physics and nuclear structure are given.

Double point curves for corank 2 map germs from C-2 to C-3

We characterize finite determinacy of map germs f : (C-2, 0) -> (C-3, 0) in terms of the Milnor number mu(D(f)) of the double point curve D(f) in (C-2, 0) and we provide an explicit description of the double point scheme in terms of elementary symmetric functions. Also we prove that the Whitney equisingularity of 1-parameter families of map germs f(t) : (C-2, 0) -> (C-3, 0) is equivalent to the constancy of both mu(D(f(t))) and mu(f(t)(C-2)boolean AND H) with respect to t, where H subset of C-3 is a generic plane. (C) 2011 Elsevier B.V. All rights reserved.

Geometrisch-analytische Theorie der symmetrischen S-Functionen mit einem einfachen Nebenpunkt.

Habilitationsschrift--Halle a.S.

Formal group laws and hypergraph colorings

Thesis (Ph.D.)--University of Washington, 2016-06

On derivatives and norms of generalized matrix functions and respective symmetric powers

In recent papers, the authors obtained formulas for directional derivatives of all orders, of the immanant and of the m-th xi-symmetric tensor power of an operator and a matrix, when xi is a character of the full symmetric group. The operator norm of these derivatives was also calculated. In this paper, similar results are established for generalized matrix functions and for every symmetric tensor power.

Elicited bid functions in (a)symmetric first-price auctions

We report on a series of experiments that examine bidding behavior in first-price sealed bid auctions with symmetric and asymmetric bidders. To study the extent of strategic behavior, we use an experimental design that elicits bidders' complete bid functions in each round (auction) of the experiment. In the aggregate, behavior is consistent with the basic equilibrium predictions for risk neutral or homogenous risk averse bidders (extent of bid shading, average seller's revenues and deviations from equilibrium). However, when we look at the extent of best reply behavior and the shape of bid functions, we find that individual behavior is not in line with the received equilibrium models, although it exhibits strategic sophistication.

Vector Boolean Functions: Applications in Symmetric Cryptography

Esta tesis establece los fundamentos teóricos y diseña una colección abierta de clases C++ denominada VBF (Vector Boolean Functions) para analizar funciones booleanas vectoriales (funciones que asocian un vector booleano a otro vector booleano) desde una perspectiva criptográfica. Esta nueva implementación emplea la librería NTL de Victor Shoup, incorporando nuevos módulos que complementan a las funciones de NTL, adecuándolas para el análisis criptográfico. La clase fundamental que representa una función booleana vectorial se puede inicializar de manera muy flexible mediante diferentes estructuras de datas tales como la Tabla de verdad, la Representación de traza y la Forma algebraica normal entre otras. De esta manera VBF permite evaluar los criterios criptográficos más relevantes de los algoritmos de cifra en bloque y de stream, así como funciones hash: por ejemplo, proporciona la no-linealidad, la distancia lineal, el grado algebraico, las estructuras lineales, la distribución de frecuencias de los valores absolutos del espectro Walsh o del espectro de autocorrelación, entre otros criterios. Adicionalmente, VBF puede llevar a cabo operaciones entre funciones booleanas vectoriales tales como la comprobación de igualdad, la composición, la inversión, la suma, la suma directa, el bricklayering (aplicación paralela de funciones booleanas vectoriales como la empleada en el algoritmo de cifra Rijndael), y la adición de funciones coordenada. La tesis también muestra el empleo de la librería VBF en dos aplicaciones prácticas. Por un lado, se han analizado las características más relevantes de los sistemas de cifra en bloque. Por otro lado, combinando VBF con algoritmos de optimización, se han diseñado funciones booleanas cuyas propiedades criptográficas son las mejores conocidas hasta la fecha. ABSTRACT This thesis develops the theoretical foundations and designs an open collection of C++ classes, called VBF, designed for analyzing vector Boolean functions (functions that map a Boolean vector to another Boolean vector) from a cryptographic perspective. This new implementation uses the NTL library from Victor Shoup, adding new modules which complement the existing ones making VBF better suited for cryptography. The fundamental class representing a vector Boolean function can be initialized in a flexible way via several alternative types of data structures such as Truth Table, Trace Representation, Algebraic Normal Form (ANF) among others. This way, VBF allows the evaluation of the most relevant cryptographic criteria for block and stream ciphers as well as for hash functions: for instance, it provides the nonlinearity, the linearity distance, the algebraic degree, the linear structures, the frequency distribution of the absolute values of the Walsh Spectrum or the Autocorrelation Spectrum, among others. In addition, VBF can perform operations such as equality testing, composition, inversion, sum, direct sum, bricklayering (parallel application of vector Boolean functions as employed in Rijndael cipher), and adding coordinate functions of two vector Boolean functions. This thesis also illustrates the use of VBF in two practical applications. On the one hand, the most relevant properties of the existing block ciphers have been analysed. On the other hand, by combining VBF with optimization algorithms, new Boolean functions have been designed which have the best known cryptographic properties up-to-date.

Fekete-Szegoe problem for certain subclasses of analytic functions with respect to symmetric points

MSC 2010: 30C45

New Coefficient Conditions for Functions Starlike with Respect to Symmetric Points

2000 Mathematics Subject Classification: Primary 30C45, secondary 30C80.

Extensions of discrete triangular distributions and boundary bias in kernel estimation for discrete functions

Asymmetric discrete triangular distributions are introduced in order to extend the symmetric ones serving for discrete associated kernels in the nonparametric estimation for discrete functions. The extension from one to two orders around the mode provides a large family of discrete distributions having a finite support. Establishing a bridge between Dirac and discrete uniform distributions, some different shapes are also obtained and their properties are investigated. In particular, the mean and variance are pointed out. Applications to discrete kernel estimators are given with a solution to a boundary bias problem. (C) 2010 Elsevier B.V. All rights reserved.

Mapping the royal road and other hierarchical functions

In this paper we present a technique for visualising hierarchical and symmetric, multimodal fitness functions that have been investigated in the evolutionary computation literature. The focus of this technique is on landscapes in moderate-dimensional, binary spaces (i.e., fitness functions defined over {0, 1}(n), for n less than or equal to 16). The visualisation approach involves an unfolding of the hyperspace into a two-dimensional graph, whose layout represents the topology of the space using a recursive relationship, and whose shading defines the shape of the cost surface defined on the space. Using this technique we present case-study explorations of three fitness functions: royal road, hierarchical-if-and-only-if (H-IFF), and hierarchically decomposable functions (HDF). The visualisation approach provides an insight into the properties of these functions, particularly with respect to the size and shape of the basins of attraction around each of the local optima.