Related papers: The balancing index over the alternating group
Motivated by charge balancing constraints for rank modulation schemes, we introduce the notion of balanced permutations and derive the capacity of balanced permutation codes. We also describe simple interleaving methods for permutation code…
Consider a sparse multivariate polynomial f with integer coefficients. Assume that f is represented as a "modular black box polynomial", e.g. via an algorithm to evaluate f at arbitrary integer points, modulo arbitrary positive integers.…
Let $n$ be an arbitrary integer, let $p$ be a prime factor of $n$. Denote by $\omega_1$ the $p^{th}$ primitive unity root, $\omega_1:=e^{\frac{2\pi i}{p}}$. Define $\omega_i:=\omega_1^i$ for $0\leq i\leq p-1$ and…
Abundancy index refers to the ratio of the sum of the divisors of a number to the number itself. It is a concept of great importance in defining friendly and perfect numbers. Here, we describe a suitable generalization of abundancy index to…
Let $q$ be a prime power and $n$ and $r$ be positive integers. It is well known that the linearized binomial $L_r(x)=x^{q^r}+ax\in\mathbb{F}_{q^n}[x]$ is a permutation polynomial if and only if $(-1)^{n/d}a^{{(q^n-1)}/{(q^{d}-1)}}\neq 1$…
\noindent In our contribution to this volume we deal with \emph{discrete} symmetries: these are symmetries based upon groups with a discrete set of elements (generally a set of elements that can be enumerated by the positive integers). In…
An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the…
In 2014, T. Komatsu and L. Szalay studied the balancing binomial coefficients. In this paper, we focus on the following Diophantine equation $$\binom{1}{5}+\binom{2}{5}+...+\binom{x-1}{5}=\binom{x+1}{5}+...+\binom{y}{5}$$ where $y>x>5$ are…
A permutation is called {\it {block-wise simple}} if it contains no interval of the form $p_1\oplus p_2$ or $p_1 \ominus p_2$. We present this new set of permutations and explore some of its combinatorial properties. We present a generating…
For a sample of absolutely bounded i.i.d. random variables with a continuous density the cumulative distribution function of the sample variance is represented by a univariate integral over a Fourier series. If the density is a polynomial…
The alternating and non-alternating harmonic sums and other algebraic objects of the same equivalence class are connected by algebraic relations which are induced by the product of these quantities and which depend on their index calss…
A subspace of an algebra with involution is called a Lie skew-ideal if it is closed under Lie products with skew-symmetric elements. Lie skew-ideals are classified in central simple algebras with involution (there are eight of them for…
Balancing numbers $n$ are originally defined as the solution of the Diophantine equation $1+2+\cdots+(n-1)=(n+1)+\cdots+(n+r)$, where $r$ is called the balancer corresponding to the balancing number $n$. By slightly modifying, $n$ is the…
The class of index-mixed copulas is introduced and its properties are investigated. Index-mixed copulas are constructed from given base copulas and a random index vector, and show a rather remarkable degree of analytical tractability. The…
Suppose that $\langle f_n \rangle$ is a sequence of polynomials, $\langle f_n^{(k)}(0)\rangle$ converges for every non-negative integer $k$, and that the limit is not $0$ for some $k$. It is shown that if all the zeros of $f_1, f_2, \dots$…
Let Sym_n denote the symmetric group of all permutations pi = a_1...a_n of {1,...,n}. An index i is a peak of pi if a_{i-1} < a_i > a_{i+1} and we let P(pi) be the set of peaks of pi. Given any set S of positive integers we define P(S;n) to…
Weighted voting games are ubiquitous mathematical models which are used in economics, political science, neuroscience, threshold logic, reliability theory and distributed systems. They model situations where agents with variable voting…
We explore the switching-algebraic computation of the Banzhaf indices for general and monotone or unrestricted systems. This computation is achieved via (a) two Boolean-quotient formulas that are valid when the voting system is not…
Given integers $a_1, a_2, ..., a_n$, with $a_1 + a_2 + ... + a_n \geq 1$, a symmetrically constrained composition $\lambda_1 + lambda_2 + ... + lambda_n = M$ of $M$ into $n$ nonnegative parts is one that satisfies each of the the $n!$…
We classify, according to their computational complexity, integer optimization problems whose constraints and objective functions are polynomials with integer coefficients and the number of variables is fixed. For the optimization of an…