Related papers: Associative string functions
New classes of distance-constrained structures are introduced, namely string-node nets and meshes, a mesh being a string-node net for which the nodes are dense in the strings. Various construction schemes are given including the minimal…
We consider the task of constructing a data structure for associating a static set of keys with values, while allowing arbitrary output values for queries involving keys outside the set. Compared to hash tables, these so-called static…
We make some remarks on possible definition of open string path integral in the presence of additional boundary couplings corresponding to the presence of masses at the ends of the string. These couplings are not conformally invariant…
The notion of string attractor has been introduced in [Kempa and Prezza, 2018] in the context of Data Compression and it represents a set of positions of a finite word in which all of its factors can be "attracted". The smallest size…
String algebras, in the usual sense, are finite-dimensional algebras over a given ground field. We recall a generalisation of the definition of a string algebra, which was introduced in a previous paper of the author. This generalisation…
We interpret a fuzzy set as a random availability function and provide sufficient conditions under which a preference relation over the set of all random availability functions can be represented by a utility function.
In this set of notes we simplify the formulation of the Poincare'-invariant effective string theory in D dimensions by adding an intrinsic metric and embedding its dynamics into the Polyakov formalism. We use this formalism to construct…
We present functions that quantify the contribution of a set of arguments in quantitative bipolar argumentation graphs to (the final strength of) an argument of interest, a so-called topic. Our set contribution functions are generalizations…
Partition functions for non-interacting particles are known to be symmetric functions. It is shown that powerful group-theoretical techniques can be used not only to derive these relationships, but also to significantly simplify calculation…
We initiate the study of a quantitative measure for the failure of a binary operation to be commutative and associative. We call this measure the associative-commutative spectrum as it extends the so-called associative spectrum (also known…
String functions are important building blocks of characters of integrable highest modules over affine Kac--Moody algebras. Kac and Peterson computed string functions for affine Lie algebras of type $A_{1}^{(1)}$ in terms of Dedekind eta…
Using light cone string field theory we derive recursion relations for closed string correlation functions and scattering amplitudes which hold to all orders in perturbation theory. These results extend to strings in a plane wave…
We investigate the barycentric associativity property for functions with indefinite arities and discuss the more general property of barycentric preassociativity, a generalization of barycentric associativity which does not involve any…
A program is usually represented as a word chain. It is exactly a word chain that appears as the lexical analyzer output and is parsed. The work shows that a program can be syntactically represented as an oriented word tree, that is a…
Harmonic functions of two variables are exactly those that admit a conjugate, namely a function whose gradient has the same length and is everywhere orthogonal to the gradient of the original function. We show that there are also partial…
These notes are devoted to the intriguing and still largely unexplored links between String Theory and Higher Spins, the types of excitations that lie behind its most cherished properties. A closer look at higher-spin fields provides some…
We introduce a new class of non-standard variable-length codes, called adaptive codes. This class of codes associates a variable-length codeword to the symbol being encoded depending on the previous symbols in the input data string. An…
Neural codes are collections of binary strings motivated by patterns of neural activity. In this paper, we study algorithmic and enumerative aspects of convex neural codes in dimension 1 (i.e. on a line or a circle). We use the theory of…
A brief review of the status of duality symmetries in string theory is presented. The evidence is accumulating rapidly that an enormous group of duality symmetries, including perturbative T dualities and non-perturbative S-dualities,…
After briefly reviewing basic concepts of perturbative string theory, we explain in simple terms some of the new findings that created excitement among the string physicists. These developments include non-perturbative dualities and a…