English
Related papers

Related papers: On Symmetric Invertible Binary Pairing Functions

200 papers

We present a versatile construction allowing one to obtain pairs of integer sets with infinite symmetric difference, infinite intersection, and identical representation functions.

Number Theory · Mathematics 2015-11-05 Yong-Gao Chen , Vsevolod F. Lev

Let R be a commutative ring and let n,m be two positive integers. Let be the polynomial ring in m x n commuting independent variables R. The symmetric group on n letters acts diagonally on A(n,m). We give generators and relations of the…

Rings and Algebras · Mathematics 2007-05-23 Francesco Vaccarino

A pairing function for the non-negative integers is said to be binary perfect if the binary representation of the output is of length 2k or less whenever each input has length k or less. Pairing functions with square shells, such as the…

Discrete Mathematics · Computer Science 2018-11-13 Matthew P. Szudzik

An invertible polynomial in $n$ variables is a quasihomogeneous polynomial consisting of $n$ monomials so that the weights of the variables and the quasi-degree are well defined. In the framework of the construction of mirror symmetric…

Algebraic Geometry · Mathematics 2014-07-02 Wolfgang Ebeling , Sabir M. ~Gusein-Zade

The paper proves two results involving a pair (A,B) of P-biisometric or (m,P)-biisometric Hilbert-space operators for arbitrary positive integer m and positive operator P. It is shown that if A and B are power bounded and the pair (A,B) is…

Functional Analysis · Mathematics 2024-12-17 B. P. Duggal , C. S. Kubrusly

Let R be a commutative ring and let n,m be two positive integers. The symmetric group on n letters acts diagonally on the ring of polynomials in nxm variables with coefficients in R. The subrings of invariants for this action is called the…

Combinatorics · Mathematics 2007-05-23 F. Vaccarino

In the literature, few constructions of $n$-variable rotation symmetric bent functions have been presented, which either have restriction on $n$ or have algebraic degree no more than $4$. In this paper, for any even integer $n=2m\ge2$, a…

Information Theory · Computer Science 2015-05-13 Sihong Su , Xiaohu Tang

An invertible polynomial is a quasihomogeneous polynomial with the number of monomials coinciding with the number of variables and such that the weights of the variables and the quasi-degree are well defined. In the framework of the search…

Algebraic Geometry · Mathematics 2016-05-04 Wolfgang Ebeling , Sabir M. Gusein-Zade , Atsushi Takahashi

The purpose of this paper is to characterize several classes of functional identities involving inverses with related mappings from a unital Banach algebra $\mathcal{A}$ over the complex field into a unital $\mathcal{A}$-bimodule…

Functional Analysis · Mathematics 2024-09-09 Kaijia Luo , Jiankui Li

We give a new simple construction for known binary quadratic symmetric bent and almost bent functions. In particular, for even number of variables, they are self-dual and anti-self-dual quadratic bent functions, respectively, which are not…

Information Theory · Computer Science 2019-09-24 Josep Rifà , Victor Zinoviev

Let E_n={x_i=1, x_i+x_j=x_k, x_i*x_j=x_k: i,j,k \in {1,...,n}}. We prove: (1) there is an algorithm that for every computable function f:N-->N returns a positive integer m(f), for which a second algorithm accepts on the input f and any…

Logic · Mathematics 2013-12-03 Apoloniusz Tyszka

Consider an n qubit computational basis state corresponding to a bit string x, which has had an unknown local unitary applied to each qubit, and whose qubits have been reordered by an unknown permutation. We show that, given such a state…

Quantum Physics · Physics 2009-06-18 Ashley Montanaro

Erd\"{o}s and Niven proved in 1946 that for any positive integers $m$ and $d$, there are at most finitely many integers $n$ for which at least one of the elementary symmetric functions of $1/m, 1/(m+d), ..., 1/(m+(n-1)d)$ are integers.…

Number Theory · Mathematics 2014-03-20 Yuanyuan Luo , Shaofang Hong , Guoyou Qian , Chunlin Wang

For positive integers m and n, denote S(m,n) as the associated Stirling number of the second kind and let z be a complex variable. In this paper, we introduce the Stirling functions S(m,n,z) which satisfy S(m,n,z) = S(m,n) for any z which…

Number Theory · Mathematics 2017-01-03 Matthew A Williams

Let A be a finite set of integers. For a polynomial f(x_1,...,x_n) with integer coefficients, let f(A) = {f(a_1,...,a_n) : a_1,...,a_n \in A}. In this paper it is proved that for every pair of normalized binary linear forms f(x,y)=u_1x+v_1y…

Number Theory · Mathematics 2021-01-06 Melvyn B. Nathanson , Kevin O'Bryant , Brooke Orosz , Imre Ruzsa , Manuel Silva

Let $$ A_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j\choose 2j}\sum_{k=0}^{n-1} \sin(a+2k\pi/n) \cos^{2j}(a+2k\pi/n) $$ and $$ B_{m,n}(a)=\sum_{j=0}^m (-4)^j {m+j+1\choose 2j+1}\sum_{k=0}^{n-1} \sin(a+2k\pi/n) \cos^{2j+1}(a+2k\pi/n), $$ where $m\geq…

Classical Analysis and ODEs · Mathematics 2023-01-02 Horst Alzer , Semyon Yakubovich

A symmetric function of $N$ variables can be given in terms of symmetric polynomials of these variables. We determine those symmetric polynomials in which the dual differential operators take the neatest form when expressed in terms of our…

Classical Analysis and ODEs · Mathematics 2023-02-02 Shaul Zemel

We construct bisymmetric, strictly increasing binary operations on real intervals which are not continuous. This answers a natural question in the theory of bisymmetric and mean-type operations by showing that continuity may fail for…

General Mathematics · Mathematics 2026-03-09 Gergely Kiss

A set of all symmetric Banach function spaces defined on [0,1] is equipped with the partial order by the relation of continuous inclusion. Properties of symmetric spaces, which do not depend of their position in the ordered structure, are…

Functional Analysis · Mathematics 2007-05-23 Eugene Tokarev

For any positive integers $n=2k$ and $m$ such that $m\geq k$, in this paper we show the maximal number of bent components of any $(n,m)$-functions is equal to $2^{m}-2^{m-k}$, and for those attaining the equality, their algebraic degree is…

Information Theory · Computer Science 2019-05-28 Lijing Zheng , Jie Peng , Haibin Kan , Yanjun Li , Juan Luo
‹ Prev 1 2 3 10 Next ›