Some polynomials associated with the $${\vavec{}}$$-Whitney numbes

In the present article, we study three families of polynomials associated with the r-Whitney numbers of the second kind. They are the r-Dowling polynomials, r-Whitney–Fubini polynomials and the r-Eulerian–Fubini polynomials. Then we derive several combinatorial results by using algebraic arguments (Rota’s method), combinatorial arguments (set partitions) and asymptotic methods.     

A realization theorem in the context of the Schur-Szegő composition

Every real polynomial of degree n in one variable with root ?1 can be represented as the Schur-Szeg? composition of n ? 1 polynomials of the form (x + 1) ^n?1(x + a _i ), where the numbers a _i are uniquely determined up to permutation. Some a _i are real, and the others form complex conjugate pairs. In this note, we show that for each pair (ρ, r), where 0 ? ρ, r ? [n/2], there exists a polynomial with exactly ρ pairs of complex conjugate roots and exactly r complex conjugate pairs in the corresponding set of numbers a _i .     

Strong factorization property of Macdonald polynomials and higher-order Macdonald’s positivity conjecture

We prove a strong factorization property of interpolation Macdonald polynomials when q tends to 1. As a consequence, we show that Macdonald polynomials have a strong factorization property when q tends to 1, which was posed as an open question in our previous paper with Féray. Furthermore, we introduce multivariate q, t-Kostka numbers and we show that they are polynomials in q, t with integer coefficients by using the strong factorization property of Macdonald polynomials. We conjecture that multivariate q, t-Kostka numbers are in fact polynomials in q, t with nonnegative integer coefficients, which generalizes the celebrated Macdonald’s positivity conjecture.     

Super Jack-Laurent Polynomials

Let \(\mathcal {D}_{n,m}\) be the algebra of quantum integrals of the deformed Calogero-Moser-Sutherland problem corresponding to the root system of the Lie superalgebra \(\frak {gl}(n,m)\). The algebra \(\mathcal {D}_{n,m}\) acts naturally on the quasi-invariant Laurent polynomials and we investigate the corresponding spectral decomposition. Even for general value of the parameter k the spectral decomposition is not multiplicity free and we prove that the image of the algebra \(\mathcal {D}_{n,m}\) in the algebra of endomorphisms of the generalised eigenspace is k[ε]^?r where k[ε] is the algebra of dual numbers. The corresponding representation is the regular representation of the algebra k[ε]^?r.     

The best extension of algebraic polynomials from the unit circle

We study the class \(\mathfrak{P}_n \) of algebraic polynomials P _n (x, y) in two variables of total degree n whose uniform norm on the unit circle Γ₁ centered at the origin is at most 1: \(\left\| {P_n } \right\|_{C(\Gamma _1 )} \) ≤ 1. The extension of polynomials from the class \(\mathfrak{P}_n \) to the plane with the least uniform norm on the concentric circle Γ _r of radius r is investigated. It is proved that the values θ _n (r) of the best extension of the class \(\mathfrak{P}_n \) satisfy the equalities θ _n (r) = r ⁿ for r > 1 and θ _n (r) = r ^n?1 for 0 < r < 1.     

Genealized poly-Cauchy and poly-Benoulli numbes by using incomplete $${\vavec{}}$$-Stiling numbes

In this paper we introduce restricted r-Stirling numbers of the first kind. Together with restricted r-Stirling numbers of the second kind and the associated r-Stirling numbers of both kinds, by giving more arithmetical and combinatorial properties, we introduce a new generalization of incomplete poly-Cauchy numbers of both kinds and incomplete poly-Bernoulli numbers.     

A New Class of Generalized Polynomials Associated with Hermite and Euler Polynomials

In this paper, we introduce a new class of generalized polynomials associated with the modified Milne-Thomson’s polynomials \({\Phi_{n}^{(\alpha)}(x,\nu)}\) of degree n and order α introduced by Dere and Simsek. The concepts of Euler numbers E _n , Euler polynomials E _n (x), generalized Euler numbers E _n (a, b), generalized Euler polynomials E _n (x; a, b, c) of Luo et al., Hermite–Bernoulli polynomials \({{_HE}_n(x,y)}\) of Dattoli et al. and \({{_HE}_n^{(\alpha)} (x,y)}\) of Pathan are generalized to the one \({ {_HE}_n^{(\alpha)}(x,y,a,b,c)}\) which is called the generalized polynomials depending on three positive real parameters. Numerous properties of these polynomials and some relationships between E _n , E _n (x), E _n (a, b), E _n (x; a, b, c) and \({{}_HE_n^{(\alpha)}(x,y;a,b,c)}\) are established. Some implicit summation formulae and general symmetry identities are derived using different analytical means and applying generating functions.     

Some variations on Tverberg’s theorem

Define T(d, r) = (d + 1)(r - 1) + 1. A well known theorem of Tverberg states that if n ≥ T(d, r), then one can partition any set of n points in R^d into r pairwise disjoint subsets whose convex hulls have a common point. The numbers T(d, r) are known as Tverberg numbers. Reay added another parameter k (2 ≤ k ≤ r) and asked: what is the smallest number n, such that every set of n points in R^d admits an r-partition, in such a way that each k of the convex hulls of the r parts meet. Call this number T(d, r, k). Reay conjectured that T(d, r, k) = T(d, r) for all d, r and k. In this paper we prove Reay’s conjecture in the following cases: when k ≥ [d+3/2], and also when d < rk/r-k - 1. The conjecture also holds for the specific values d = 3, r = 4, k = 2 and d = 5, r = 3, k = 2.     

Schur positivity and the <Emphasis Type="Italic">q</Emphasis>-log-convexity of the Narayana polynomials

We prove two recent conjectures of Liu and Wang by establishing the strong q-log-convexity of the Narayana polynomials, and showing that the Narayana transformation preserves log-convexity. We begin with a formula of Brändén expressing the q-Narayana numbers as a specialization of Schur functions and, by deriving several symmetric function identities, we obtain the necessary Schur-positivity results. In addition, we prove the strong q-log-concavity of the q-Narayana numbers. The q-log-concavity of the q-Narayana numbers N _q (n,k) for fixed k is a special case of a conjecture of McNamara and Sagan on the infinite q-log-concavity of the Gaussian coefficients.     

On Representation of a Solution to the Cauchy Problem by a Fourier Series in Sobolev-Orthogonal Polynomials Generated by Laguerre Polynomials

We consider the problem of representing a solution to the Cauchy problem for an ordinary differential equation as a Fourier series in polynomials l _r,k ^α (x) (k = 0, 1,...) that are Sobolev-orthonormal with respect to the inner product

$$\left\langle {f,g} \right\rangle = \sum\limits_{v = 0}^{r - 1} {{f^{(v)}}(0){g^{(v)}}} (0) + \int\limits_0^\infty {{f^{(r)}}(t)} {g^{(r)}}(t){t^\alpha }{e^{ - t}}dt$$

, and generated by the classical orthogonal Laguerre polynomials L _k ^α (x) (k = 0, 1,...). The polynomials l _r,k ^α (x) are represented as expressions containing the Laguerre polynomials L _n ^α?r (x). An explicit form of the polynomials l _r,k+r ^α (x) is established as an expansion in the powers x ^r+l , l = 0,..., k. These results can be used to study the asymptotic properties of the polynomials l _r,k ^α (x) as k→∞and the approximation properties of the partial sums of Fourier series in these polynomials.

     

Divisibility properties of hyperharmonic numbers

We extend Wolstenholme’s theorem to hyperharmonic numbers. Then, we obtain infinitely many congruence classes for hyperharmonic numbers using combinatorial methods. In particular, we show that the numerator of any hyperharmonic number in its reduced fractional form is odd. Then we give quantitative estimates for the number of pairs (n, r) lying in a rectangle where the corresponding hyperharmonic number \({ h_n^{(r)} }\) is divisible by a given prime number p. We also provide p-adic value lower bounds for certain hyperharmonic numbers. It is an open problem that given a prime number p, there are only finitely many harmonic numbers h _n which are divisible by p. We show that if we go to the higher levels r ≥  2, there are infinitely many hyperharmonic numbers \({ h_n^{(r)} }\) which are divisible by p. We also prove a finiteness result which is effective.     

Generalized <Emphasis Type="BoldItalic">r</Emphasis>-Lah numbers

In this paper, we consider a two-parameter polynomial generalization, denoted by \(\mathcal {G}_{a,b}(n,k;r)\), of the r-Lah numbers which reduces to these recently introduced numbers when a = b = 1. We present several identities for \(\mathcal {G}_{a,b}(n,k;r)\) that generalize earlier identities given for the r-Lah and r-Stirling numbers. We also provide combinatorial proofs of some earlier identities involving the r-Lah numbers by defining appropriate sign-changing involutions. Generalizing these arguments yields orthogonality-type relations that are satisfied by \(\mathcal {G}_{a,b}(n,k;r)\).     

Generic hypersurface singularities

The problem considered here can be viewed as the analogue in higher dimensions of the one variable polynomial interpolation of Lagrange and Newton. Let x₁,...,x_r be closed points in general position in projective spacePn, then the linear subspaceV ofH⁰ (?ⁿ,O(d)) (the space of homogeneous polynomials of degreed on ?ⁿ) formed by those polynomials which are singular at eachx_i, is given by r(n + 1) linear equations in the coefficients, expressing the fact that the polynomial vanishes with its first derivatives at x₁,...,x_r. As such, the “expected” value for the dimension ofV is max(0,h⁰(O(d))?r(n+1)). We prove thatV has the “expected” dimension for d≥5 (theorem A). This theorem was first proven in [A] using a very complicated induction with many initial cases. Here we give a greatly simplified proof using techniques developed by the authors while treating the corresponding problem in lower degrees.     

<Emphasis Type="Italic">r</Emphasis>-Dynamic Chromatic Number of Some Line Graphs

An r-dynamic coloring of a graph G is a proper coloring c of the vertices such that |c(N(v))| ≥ min {r, deg(v)}, for each v ∈ V (G). The r-dynamic chromatic number of a graph G is the smallest k such that G admits an r-dynamic coloring with k colors. In this paper, we obtain the r-dynamic chromatic number of the line graph of helm graphs H_n for all r between minimum and maximum degree of H_n. Moreover, our proofs are constructive, what means that we give also polynomial time algorithms for the appropriate coloring. Finally, as the first, we define an equivalent model for edge coloring.     

Fast Algorithm of Square Rooting in Some Finite Fields of Odd Characteristic

It was proved that the complexity of square root computation in the Galois field GF(3^s), s = 2^kr, is equal to O(M(2^k)M(r)k + M(r) log₂r) + 2^kkr^1+o(1), where M (n) is the complexity of multiplication of polynomials of degree n over fields of characteristics 3. The complexity of multiplication and division in the field GF(3^s) is equal to O(M(2^k)M(r)) and O(M(2^k)M(r)) + r^1+o(1), respectively. If the basis in the field GF(3^r) is determined by an irreducible binomial over GF(3) or is an optimal normal basis, then the summands 2^kkr^1+o(1) and r^1+o(1) can be omitted. For M(n) one may take n log₂nψ(n) where ψ(n) grows slower than any iteration of the logarithm. If k grow and r is fixed, than all the estimates presented here have the form O_r (M (s) log ₂s) = s (log ₂s)²ψ(s).     

On Substructure Densities of Hypergraphs

A real number α ∈ [0, 1) is a jump for an integer r ≥ 2 if there exists c > 0 such that for any ∈ > 0 and any integer m ≥ r, there exists an integer n ₀ such that any r-uniform graph with n > n ₀ vertices and density ≥ α + ∈ contains a subgraph with m vertices and density ≥ α + c. It follows from a fundamental theorem of Erdös and Stone that every α ∈ [0, 1) is a jump for r = 2. Erdös also showed that every number in [0, r!/r ^r ) is a jump for r ≥ 3 and asked whether every number in [0, 1) is a jump for r ≥ 3 as well. Frankl and Rödl gave a negative answer by showing a sequence of non-jumps for every r ≥ 3. Recently, more non-jumps were found for some r ≥ 3. But there are still a lot of unknowns on determining which numbers are jumps for r ≥ 3. The set of all previous known non-jumps for r = 3 has only an accumulation point at 1. In this paper, we give a sequence of non-jumps having an accumulation point other than 1 for every r ≥ 3. It generalizes the main result in the paper ‘A note on the jumping constant conjecture of Erdös’ by Frankl, Peng, Rödl and Talbot published in the Journal of Combinatorial Theory Ser. B. 97 (2007), 204–216.     

Intermediate links of plane curves

For a smooth complex curve C ? ?² we consider the link L_r = C ∩ ?B_r, where B_r denotes an Euclidean ball of radius r > 0. We prove that the diagram D_r obtained from L_r by a complex stereographic projection satisfies χ(C ∩B_r) = rot(D_r)?wr(D_r). As a consequence we show that if D_r has no negative Seifert circles and L_r is strongly quasipositive and fibered, then the Yamada–Vogel algorithm applied to D_r yields a quasipositive braid.     

Random embedding of $${\ell_p^n}$$ into $${\ell_r^N}$$

For any 0 < p < 2 and any natural numbers N > n, we give an explicit definition of a random operator \({S : \ell_p^n \to \mathbb{R}^N}\) such that for every 0 < r < p < 2 with r ≤ 1, the operator \({S_r = S : \ell_p^n \to \ell_r^N}\) satisfies with overwhelming probability that \({\|S_r\| \, \|(S_r)_{| {\rm Im}\, S}^{-1}\| \le C(p,r)^{n/(N-n)}}\), where C(p, r) > 0 is a real number depending only on p and r. One of the main tools that we develop is a new type of multidimensional Esseen inequality for studying small ball probabilities.     

Sums of products of Ramanujan sums

The Ramanujan sum c _n (k) is defined as the sum of k-th powers of the primitive n-th roots of unity. We investigate arithmetic functions of r variables defined as certain sums of the products \({c_{m_1}(g_1(k))\cdots c_{m_r}(g_r(k))}\), where g ₁, . . . , g _r are polynomials with integer coefficients. A modified orthogonality relation of the Ramanujan sums is also derived.     

A Note on Generalized Lagrangians of Non-uniform Hypergraphs

Set \(A\subset {\mathbb N}\) is less than \(B\subset {\mathbb N}\) in the colex ordering if m a x(A△B)∈B. In 1980’s, Frankl and Füredi conjectured that the r-uniform graph with m edges consisting of the first m sets of \({\mathbb N}^{(r)}\) in the colex ordering has the largest Lagrangian among all r-uniform graphs with m edges. A result of Motzkin and Straus implies that this conjecture is true for r=2. This conjecture seems to be challenging even for r=3. For a hypergraph H=(V,E), the set T(H)={|e|:e∈E} is called the edge type of H. In this paper, we study non-uniform hypergraphs and define L(H) a generalized Lagrangian of a non-uniform hypergraph H in which edges of different types have different weights. We study the following two questions: 1. Let H be a hypergraph with m edges and edge type T. Let C _m,T denote the hypergraph with edge type T and m edges formed by taking the first m sets with cardinality in T in the colex ordering. Does L(H)≤L(C _m,T ) hold? If T={r}, then this question is the question by Frankl and Füredi. 2. Given a hypergraph H, find a minimum subhypergraph G of H such that L(G) = L(H). A result of Motzkin and Straus gave a complete answer to both questions if H is a graph. In this paper, we give a complete answer to both questions for {1,2}-hypergraphs. Regarding the first question, we give a result for {1,r ₁,r ₂,…,r _l }-hypergraph. We also show the connection between the generalized Lagrangian of {1,r ₁,r ₂,? ,r _l }-hypergraphs and {r ₁,r ₂,? ,r _l }-hypergraphs concerning the second question.