Related papers: The balancing index over the alternating group

Let $Z(N)$ denote the minimum number of zeros in $[0,2\pi]$ that a cosine polynomial of the form $$f_A(t)=\sum_{n\in A}\cos nt$$ can have when $A$ is a finite set of non-negative integers of size $|A|=N$. It is an old problem of Littlewood…

Polynomial ensembles are determinantal point processes associated with (non necessarily orthogonal) projections onto polynomial subspaces. The aim of this survey article is to put forward the use of recurrence coefficients to obtain the…

Let $p\equiv 1 \pmod{4}$ be a prime. Write $t = \prod_{x=1}^{(p-1)/2}x$. Since $t ^2\equiv -1 \pmod{p}$ , we can divide $\{1,2,\ldots,(p-1)/2\}$ into $(p-1)/4$ ordered pairs so that each pair, say $<a,\tilde{a}>$ , satisfies that $t a…

A Boolean function of n bits is balanced if it takes the value 1 with probability 1/2. We exhibit a balanced Boolean function with a randomized evaluation procedure (with probability 0 of making a mistake) so that on uniformly random…

A symmetric periodic orbit is a special kind of periodic orbit that can also be regarded as a Lagrangian intersection point. Therefore it has two Maslov indices whose difference is the Hormander index. In this paper we provide a formula for…

Interpolation theory for complex polynomials is well understood. In the non-commutative quaternionic setting, the polynomials can be evaluated "on the left" and "on the right". If the interpolation problem involves interpolation conditions…

In this paper it is shown that a polyomino is balanced if and only if it is simple. As a consequence one obtains that the coordinate ring of a simple polyomino is a normal Cohen-Macaulay domain.

Chung and Graham define quasirandom subsets of $\mathbb{Z}_n$ to be those with any one of a large collection of equivalent random-like properties. We weaken their definition and call a subset of $\mathbb{Z}_n$ $\epsilon$-balanced if its…

We define a partial order $\mathcal{P}_n$ on permutations of any given size $n$, which is the image of a natural partial order on inversion sequences. We call this the ``middle order''. We demonstrate that the poset $\mathcal{P}_n$ refines…

Given a list of $n$ cells $L=[(p_1,q_1),...,(p_n, q_n)]$ where $p_i, q_i\in \textbf{Z}_{\ge 0}$, we let $\Delta_L=\det |{(p_j!)^{-1}(q_j!)^{-1} x^{p_j}_iy^{q_j}_i} |$. The space of diagonally alternating polynomials is spanned by…

A simplex in n dimensions is defined by the usual (n+1) linear inequality constraints in n dimensions. Here we consider simplexes which are bounded sets. The harmonic center has been defined earlier for polytopes in general. A relationship…

A polynomial with coefficients in the ring of integers $\mathcal{O}_{K}$ of a global field $K$ is called intersective if it has a root modulo every finite-indexed subgroup of $\mathcal{O}_{K}$. We prove two criteria for a polynomial…

We start with a (q,t)-generalization of a binomial coefficient. It can be viewed as a polynomial in t that depends upon an integer q, with combinatorial interpretations when q is a positive integer, and algebraic interpretations when q is…

In this paper, we present the compositional inverses of several classes permutation polynomials of the form $\sum_{i=1}^kb_i\left({\rm Tr}_m^{mn}(x)^{t_i}+\delta\right)^{s_i}+f_1(x)$, where $1\leq i \leq k,$ $s_i$ are positive integers,…

For an arbitrary finite set S of natural numbers greater 1, we construct an integer-valued polynomial f, whose set of lengths in Int(Z) is S. The set of lengths of f is the set of all natural numbers n, such that f has a factorization as a…

We show that if a polynomial $f\in \mathbb{R}[x_1,\ldots,x_n]$ is nonnegative on a closed basic semialgebraic set $X=\{x\in\mathbb{R}^n:g_1(x)\ge 0,\ldots,g_r (x)\ge 0\}$, where $g_1,\ldots,g_r\in\mathbb{R}[x_1,\ldots,x_n]$, then $f$ can be…

Let $D$ be a subset of a finite commutative ring $R$ with identity. Let $f(x)\in R[x]$ be a polynomial of positive degree $d$. For integer $0\leq k \leq |D|$, we study the number $N_f(D,k,b)$ of $k$-subsets $S\subseteq D$ such that…

We count subrings of small index of $\mathbb{Z}^n$, where the addition and multiplication are defined componentwise. Let $f_n(k)$ denote the number of subrings of index $k$. For any $n$, we give a formula for this quantity for all integers…

Let $\pi=(\pi_1,\pi_2,\hdots,\pi_n)$ be permutation of the elements $1,2,\hdots,n. $ Positive integer $k\leq2^{n-1}$ we call index of $\pi,$ if in its binary notation as $n$-digital binary number, the 1's correspond to the ascent points. We…

A celebrated theorem of Balas gives a linear mixed-integer formulation for the union of two nonempty polytopes whose relaxation gives the convex hull of this union. The number of inequalities in Balas formulation is linear in the number of…