Related papers: On Symmetric Invertible Binary Pairing Functions
Let $V$ be society whose members express preferences about two alternatives, indifference included. Identifying anonymous binary social choice functions with binary functions $f=f(k,m)$ defined over the integer triangular grid $G=\{(k,m)\in…
The number of linear independent algebraic relations among elementary symmetric polynomial functions over finite fields is computed. An algorithm able to find all such relations is described. It is proved that the basis of the ideal of…
For each positive integer n, we determine the set of symmetric functions f for which the congruence f(p/1,p/2,...,p/(p-1)) \equiv 0 mod p^n holds for all sufficiently large primes p. Our determination is conditional on a conjecture…
It is well known that over an infinite field the ring of symmetric functions in a finite number of variables is isomorphic to the one of polynomial functions on matrices that are invariants by the action of conjugation by general linear…
We consider a joint ordered multifactorisation for a given positive integer $n\geq 2$ into $m$ parts, where $n=n_1~\times~\ldots~\times~n_m$, and each part $n_j$ is split into one or more component factors. Our central result gives an…
A certain analysis of all possible associative binary operations on N is presented. This is equivalent with an analysis of all possible monoid structures on N. Several results and a conjecture in this regard are given.
The symmetric function theorem states that a polynomial that is invariant under permutation of variables, is a polynomial in the elementary symmetric polynomials. We deduce this classical result, in the analytic setting, from the…
We study the space of biinvariants and zonal spherical functions associated to quantum symmetric pairs in the maximally split case. Under the obvious restriction map, the space of biinvariants is proved isomorphic to the Weyl group…
A pair of odd primes is said to be symmetric if each prime is congruent to one modulo their difference. A theorem from 1996 by Fletcher, Lindgren, and the third author provides an upper bound on the number of primes up to x that belong to a…
A "pairing function" J associates a unique natural number z to any two natural numbers x,y such that for two "unpairing functions" K and L, the equalities K(J(x,y))=x, L(J(x,y))=y and J(K(z),L(z))=z hold. Using pairing functions on natural…
We analyze the notion of reproducing pair of weakly measurable functions, which generalizes that of continuous frame. We show, in particular, that each reproducing pair generates two Hilbert spaces, conjugate dual to each other. Several…
Using polynomial interpolation, along with structural properties of the family of positive real rational functions, we here show that a set of m nodes in the open left half of the complex plane, can always be mapped to anywhere in the…
We prove a noncommutative analogue of the fact that every symmetric analytic function of $(z,w)$ in the bidisc $\D^2$ can be expressed as an analytic function of the variables $z+w$ and $zw$. We construct an analytic nc-map $S$ from the…
We give a combinatorial formula for the inverses of the alternating sums of free quasi-symmetric functions of the form F_{\omega(I)} where I runs over compositions with parts in a prescribed set C. This proves in particular three special…
The spectra of signed matrices have played a fundamental role in social sciences, graph theory, and control theory. In this work, we investigate the computational problems of identifying symmetric signings of matrices with natural spectral…
Bent functions of the form $\mathbb{F}_2^n\rightarrow\mathbb{Z}_q$, where $q\geqslant2$ is a positive integer, are known as generalized bent (gbent) functions. Gbent functions for which it is possible to define a dual gbent function are…
We define an enumerative function F(n,k,P,m) which is a generalization of binomial coefficients. Special cases of this function are also power function, factorials, rising factorials and falling factorials. The first section of the paper is…
In 1946, P. Erd\H{o}s and I. Niven proved that there are only finitely many positive integers $n$ for which one or more of the elementary symmetric functions of $1,1 / 2$, $\cdots, 1 / n$ are integers. In 2012, Y. Chen and M. Tang proved…
An involution on a semigroup S (or any algebra with an underlying associative binary operation) is a function f:S->S that satisfies f(xy)=f(y)f(x) and f(f(x))=x for all x,y in S. The set I(S) of all such involutions on S generates a…
In this paper we use a formula for the $n$-th power of a $2\times2$ matrix $A$ (in terms of the entries in $A$) to derive various combinatorial identities. Three examples of our results follow. 1) We show that if $m$ and $n$ are positive…