相关论文: Restricted permutations and Chebyshev polynomials

For each prime p other than 3, and each power q=p^k, we present two large classes of permutation polynomials over F_{q^2} of the form X^r B(X^{q-1}) which have at most five terms, where B(X) is a polynomial with coefficients in {1,-1}. The…

Let $S_n$ and $S_{n,k}$ be, respectively, the number of subsets and $k$-subsets of $\mathbb{N}_n=\{1,\ldots,n\}$ such that no two subset elements differ by an element of the set $\mathcal{Q}$, the largest element of which is $q$. We prove a…

New finite-dimensional representations of specific polynomial deformations of sl(2,R) are constructed. The corresponding generators can be, in particular, realized through linear differential operators preserving a finite-dimensional…

In this paper, we investigate the reconstruction of permutations on {1, 2, ..., n} from betweenness constraints involving the minimum and the maximum element located between t and t+1, for all t=1, 2, ..., n-1. We propose two variants of…

In his paper of 2000, Kenneth B. Stolarsky made various observations and conjectures about discriminants and generating functions of certain types of Chebyshev-like polynomials. We prove several of these conjectures. One of our proofs…

We outline an approach to understanding restrictions of polynomial representations of $GL_n(\mathbb{C})$ to $S_n$ by first restricting to $T \rtimes S_n$, the subgroup of $n \times n$ monomial matrices. Using this approach we give a…

The aim of this paper is to give a new approach to modified $q$-Bernstein polynomials for functions of several variables. By using these polynomials, the recurrence formulas and some new interesting identities related to the second Stirling…

We provide constructions of bent functions using triples of permutations. This approach is due to Mesnager. In general, involutions have been mostly considered in such a machinery; we provide some other suitable triples of permutations,…

In this short paper, we give an upper bound for the number of different basic feasible solutions generated by the simplex method for linear programming problems having optimal solutions. The bound is polynomial of the number of constraints,…

In the paper, the authors find two closed forms involving the Stirling numbers of the second kind and in terms of a determinant of combinatorial numbers for the Bernoulli polynomials and numbers.

Using the language of Riordan arrays, we study a one-parameter family of orthogonal polynomials that we call the restricted Chebyshev-Boubaker polynomials. We characterize these polynomials in terms of the three term recurrences that they…

We give a bound for the number of real solutions to systems of n polynomials in n variables, where the monomials appearing in different polynomials are distinct. This bound is smaller than the fewnomial bound if this structure of the…

We consider the integer Chebyshev problem, that of minimizing the supremum norm over polynomials with integer coefficients on the interval $[0,1]$. We implement algorithms from semi-infinite programming and a branch and bound algorithm to…

The technique of $Q$-polinomials are used to derive the $w$- constraints in the two-matrix and Kontsevich-like model at finite $N$. These constraints are closed and form Lie algebra. They are associated with the matrices, $\lambda…

In this paper we generalize and specialize generating functions for classical orthogonal polynomials, namely Jacobi, Gegenbauer, Chebyshev and Legendre polynomials. We derive a generalization of the generating function for Gegenbauer…

We solve the problem of factoring polynomials $V_n(x) \pm 1$ and $W_n(x) \pm 1$ where $V_n(x)$ and $W_n(x)$ are Chebyshev polynomials of the third and fourth kinds. The method of proof is based on previous work by Wolfram [12] for factoring…

We construct multiple representations relative to different bases of the generalized Tschebyscheff polynomials of second kind. We build the change-of-basis matrices between the generalized Tschebyscheff of the second kind polynomial basis…

New methods for derivation of Bell polynomials of the second kind are presented. The methods are based on an ordinary generating function and its composita. The relation between a composita and a Bell polynomial is demonstrated. Main…

Given $n$ polynomials $p_1, \dots, p_n$ of degree at most $n$ with $\|p_i\|_\infty \le 1$ for $i \in [n]$, we show there exist signs $x_1, \dots, x_n \in \{-1,1\}$ so that \[\Big\|\sum_{i=1}^n x_i p_i\Big\|_\infty < 30\sqrt{n}, \] where…

We derive a stronger uniqueness result if a function with compact support and its truncated Hilbert transform are known on the same interval by using the Sokhotski-Plemelj formulas. To find a function from its truncated Hilbert transform,…