English
Related papers

Related papers: On Symmetric Invertible Binary Pairing Functions

200 papers

For any $m,n\in\mathbb{N}$ we first give new proofs for the following well known combinatorial identities \begin{equation*} S_n(m)=\sum\limits_{k=1}^n\binom{n}{k}\frac{(-1)^{k-1}}{k^m}=\sum\limits_{n\geq r_1\geq r_2\geq...\geq r_m\geq…

Number Theory · Mathematics 2017-03-21 Necdet Batir

We calculate the Fourier transform of a spherically symmetric exponential function. Our evaluation is much simpler than the known one. We use the polar coordinates and reduce the Fourier transform to the integral of a rational function of…

Classical Analysis and ODEs · Mathematics 2019-01-01 Hideshi Yamane

Given an element in a finite-dimensional real vector space, $V$, that is a nonnegative linear combination of basis vectors for some basis $B$, we compute the probability that it is furthermore a nonnegative linear combination of basis…

Combinatorics · Mathematics 2021-03-29 Rebecca Patrias , Stephanie van Willigenburg

We present a new look at description of real finite-dimensional Lie algebras. The basic element turns out to be a pair $(F,v)$ consisting of a linear mapping $F\in End(V)$ and its eigenvector $v$. This pair allows to build a Lie bracket on…

Mathematical Physics · Physics 2023-05-05 Alina Dobrogowska , Grzegorz Jakimowicz

Let $m$ be a positive integer and let $\rho(m,n)$ be the proportion of permutations of the symmetric group ${\rm Sym}(n)$ whose order is coprime to $m$. In 2002, Pouyanne proved that $\rho(n,m)n^{1-\frac{\phi(m)}{m}}\sim \kappa_m$ where…

Combinatorics · Mathematics 2019-04-19 John Bamberg , S. P. Glasby , Scott Harper , Cheryl E. Praeger

We say a natural number $n$ is matchable if there is a bijection from the set of $\tau(n)$ divisors of $n$ to the set $\{1,2,\dots,\tau(n)\}$, where corresponding numbers are relatively prime. We show that the set of matchable numbers has…

Number Theory · Mathematics 2026-05-26 Nathan McNew , Carl Pomerance

The distance of a binary operation from being associative can be "measured" by its associative spectrum, an appropriate sequence of positive integers. Particular instances and general properties of associative spectra are studied.

Rings and Algebras · Mathematics 2011-02-11 Béla Csákány , Tamás Waldhauser

In this paper we compute the Fourier spectra of some recently discovered binomial APN functions. One consequence of this is the determination of the nonlinearity of the functions, which measures their resistance to linear cryptanalysis.…

Discrete Mathematics · Computer Science 2008-12-18 Carl Bracken , Eimear Byrne , Nadya Markin , Gary McGuire

Given integers s and t, define a function phi_{s,t} on the space of all formal complex series expansions by phi_{s,t} (sum a_n x^n) = sum a_{sn+t} x^n. We define an integer r to be distinguished with respect to (s,t) if r and s are…

Number Theory · Mathematics 2007-05-23 Curtis D. Bennett , Edward Mosteig

We prove that a symmetric nonnegative function of two variables on a Lebesgue space that satisfies the triangle inequality for almost all triples of points is equivalent to some semimetric. Some other properties of metric triples (spaces…

Metric Geometry · Mathematics 2011-12-13 F. V. Petrov , P. B. Zatitskiy

We define an equivalence relation on integer compositions and show that two ribbon Schur functions are identical if and only if their defining compositions are equivalent in this sense. This equivalence is completely determined by means of…

Combinatorics · Mathematics 2007-06-20 Louis J. Billera , Hugh Thomas , Stephanie van Willigenburg

Substitution boxes (S-boxes) play a significant role in ensuring the resistance of block ciphers against various attacks. The Upper Boomerang Connectivity Table (UBCT), the Lower Boomerang Connectivity Table (LBCT) and the Double Boomerang…

Cryptography and Security · Computer Science 2024-04-19 Yuying Man , Nian Li , Zhen Liu , Xiangyong Zeng

We consider the problem of learning regression functions from pairwise data when there exists prior knowledge that the relation to be learned is symmetric or anti-symmetric. Such prior knowledge is commonly enforced by symmetrizing or…

Machine Learning · Computer Science 2015-06-22 Tapio Pahikkala , Markus Viljanen , Antti Airola , Willem Waegeman

We consider chiral fermionic conformal field theories (CFTs) constructed from lattices and investigate their orbifolds under reflection and shift $\mathbb{Z}_2$ symmetries. For lattices based on binary error-correcting codes, we show the…

High Energy Physics - Theory · Physics 2024-09-20 Kohki Kawabata , Shinichiro Yahagi

Let X be a set of analytic functions on the open unit disk D, and let phi be an analytic function on D such that phi(D) is contained in D and f |-> f o phi takes X into itself. We present conditions on X ensuring that if f |-> f o phi is…

Functional Analysis · Mathematics 2012-11-20 Paul S. Bourdon

We show that for any smooth Hausdorff manifolds M and N, which are not necessarily second countable, paracompact or connected, any isomorphism from the algebra of smooth (real or complex) functions on N to the algebra of smooth functions on…

Differential Geometry · Mathematics 2007-05-23 Janez Mrcun

In this paper we derive some identities and inequalities on the M\"obius mu function. Our main tool is phi functions for intervals of positive integers and their unions.

Number Theory · Mathematics 2009-10-20 Mohamed El bachraoui , Mohamed Salim

Let A be a finite-dimensional associative algebra and $\phi$ a symmetric linear function on $A$. In this note, we will show that the pseudotrace maps are obtained as special cases of well-known symmetric linear functions on the endomorphism…

Rings and Algebras · Mathematics 2010-01-18 Yusuke Arike

We study Schroder paths drawn in a (m,n) rectangle, for any positive integers m and n. We get explicit enumeration formulas, closely linked to those for the corresponding (m,n)-Dyck paths. Moreover we study a Schroder version of…

Combinatorics · Mathematics 2016-04-01 Jean-Christophe Aval , Francois Bergeron

A structure $\mathcal{M}$ in a first-order language $\mathcal{L}$ is \emph{indivisible} if for every coloring of $M$ in two colors, there is a monochromatic $\mathcal{M}^{\prime} \subseteq \mathcal{M}$ such that…

Logic · Mathematics 2019-09-04 Nadav Meir