Related papers: The balancing index over the alternating group

Gap balancing numbers are a certain generalization of balancing and cobalancing numbers that arise from studying the equation ${T(L)+T(B)=T(m)}$ where $T(i)$ is the $i$th triangular number. In this paper, we survey early results, attempt to…

Let $f(x_1,...,x_k)$ be a polynomial over a field $K$. This paper considers such questions as the enumeration of the number of nonzero coefficients of $f$ or of the number of coefficients equal to $\alpha\in K^*$. For instance, if $K=\ff_q$…

The definition of the binomial coefficient in terms of gamma functions also allows non-integer arguments. For nonnegative integer arguments the gamma functions reduce to factorials, leading to the well-known Pascal triangle. Using a…

Given a polynomial $f(x_1,x_2,\ldots, x_t)$ in $t$ variables with integer coefficients and a positive integer $n$, let $\alpha(n)$ be the number of integers $0\leq a<n$ such that the polynomial congruence $f(x_1, x_2, \ldots, x_t)\equiv a\…

In this article, we give a formula for the generalization of the binomial coefficient to the complex numbers as a linear combination of $\sinc$ functions. We then give a general formula to compute the integral on the real line of the…

Let $B_n$ be the $n$-th balancing number. In this paper, we give some explicit expressions of $\sum_{l=0}^{2 r-3}(-1)^l\binom{2 r-3}{l}\sum_{j_1+\cdots+j_r=n-2 l\atop j_1,\dots,j_r\ge 1}B_{j_1}\cdots B_{j_r}$ and…

There is a growing literature on sums of reciprocals of polynomial functions of recurrence relations with constant coefficients and fixed depth, such as Fibonacci and Tribonacci numbers, products of such numbers, and balancing numbers…

By polynomial (or extended binomial) coefficients, we mean the coefficients in the expansion of integral powers, positive and negative, of the polynomial $1+t +\cdots +t^{m}$; $m\geq 1$ being a fixed integer. We will establish several…

We classify general systems of polynomial equations with a single solution, or, equivalently, collections of lattice polytopes of minimal positive mixed volume. As a byproduct, this classification provides an algorithm to evaluate the…

We are presenting an algorithm capable of simplifying tensor polynomials with indices when the building tensors have index symmetry properties. These properties include simple symmetry, cyclicity and those due to the presence of partial and…

A complex harmonic polynomial is the sum of a complex polynomial and a conjugated complex polynomial, of degrees $n$ and $m$ respectively. Li and Wei (2009) presented a formula for the expected number of zeros of a random harmonic…

A set $U$ of unit vectors is selectively balancing if one can find two disjoint subsets $U^+$ and $U^-$, not both empty, such that the Euclidean distance between the sum of $U^+$ and the sum of $U^-$ is smaller than $1$. We prove that the…

For every list of integers x_1, ..., x_m there is some j such that x_1 + ... + x_j - x_{j+1} - ... - x_m \approx 0. So the list can be nearly balanced and for this we only need one alternation between addition and subtraction. But what if…

We show that the K_1 group of a C*-algebra $A$ can be defined as homotopy classes of pairs, called balanced, of not necessarily unitary matrices over $A$ that have equal defects from being unitary. We also consider pairs of order zero…

In this paper we introduce the additive analogue of the index of a polynomial over finite fields. We study several problems in the theory of polynomials over finite fields in terms of their additive indices, such as value set sizes, bounds…

The Gini index is a number that attempts to measure how equitably a resource is distributed throughout a population, and is commonly used in economics as a measurement of inequality of wealth or income. The Gini index is often defined as…

The article contains a preliminary glance at balanced clustering problems. Basic balanced structures and combinatorial balanced problems are briefly described. A special attention is targeted to various balance/unbalance indices (including…

Let R be an integral domain and let f(X) be a nonzero polynomial in R[X]. The content of f is the ideal c(f) generated by the coefficients of f. The polynomial f(X) is called Gaussian if c(fg)=c(f)c(g) for all g(X) in R[X]. It is well known…

We describe immanants as trivial modules of the symmetric group and show that any homogeneous polynomial of degree n on the space of n by n matrices preserved up to scalar by left and right action by diagonal matrices and conjugation by…

Conservative inference is a major concern in simulation-based inference. It has been shown that commonly used algorithms can produce overconfident posterior approximations. Balancing has empirically proven to be an effective way to mitigate…