A family of q-Dyson style constant term identities

By generalizing Gessel-Xin's Laurent series method for proving the Zeilberger-Bressoud q-Dyson Theorem, we establish a family of q-Dyson style constant term identities. These identities give explicit formulas for certain coefficients of the q-Dyson product, including three conjectures of Sills' as special cases and generalizing Stembridge's first layer formulas for characters of SL(n,C).     

Haglund's conjecture for multi-t Macdonald polynomials

We provide new approaches to prove identities for the modified Macdonald polynomials via their LLT expansions. As an application, we prove a conjecture of Haglund concerning the multi-t-Macdonald polynomials of two rows.     

Dade's Invariant Conjecture for the Symplectic Group Sp4(2 n ) and the Special Unitary Group SU4(22n ) in Defining Characteristic

In this article, we verify Dade's projective invariant conjecture for the symplectic group Sp₄(2 ⁿ ) and the special unitary group SU₄(2²ⁿ ) in the defining characteristic, that is, in characteristic 2. Furthermore, we show that the Isaacs–Malle–Navarro version of the McKay conjecture holds for Sp₄(2 ⁿ ) and SU₄(2²ⁿ ) in the defining characteristic, that is, Sp₄(2 ⁿ ) and SU₄(2²ⁿ ) are good for the prime 2 in the sense of Isaacs, Malle, and Navarro.     

On a question of Zhang

When studying the conjugacy class version of the Huppert’s ρ-σ conjecture, Jiping Zhang raised a number theory question. In this article, we provide examples to show that the question raised by Zhang is not always true in general.     

Applications of hypergeometric summation theorems of kummer and dixon involving double series

Using series iteration techniques, we derive a number of general double series identities and apply each of these identities in order to deduce several hypergeometric reduction formulas involving the Srivastava-Daoust double hypergeometric function. The results presented in this article are based essentially upon the hypergeometric summation theorems of Kummer and Dixon.     

Dynamic Picone's identity and its applications

We prove some Picone-type identities and inequalities for a class of first-order nonlinear dynamic systems and derive various weighted inequalities of Wirtinger type and Hardy type on time scales. As applications we study oscillatory and related properties of these systems including Reid's roundabout theorem on disconjugacy, Sturm's separation and comparison theorems, as well as a variational method in the oscillation theory.     

A unified elementary approach to the Dyson, Morris, Aomoto, and Forrester constant term identities

We introduce an elementary method to give unified proofs of the Dyson, Morris, and Aomoto identities for constant terms of Laurent polynomials. These identities can be expressed as equalities of polynomials and thus can be proved by verifying them for sufficiently many values, usually at negative integers where they vanish. Our method also proves some special cases of the Forrester conjecture.     

A unified stabilized method for Stokes’ and Darcy's equations

We use the lowest possible approximation order, piecewise linear, continuous velocities and piecewise constant pressures to compute solutions to Stokes equation and Darcy's equation, applying an edge stabilization term to avoid locking. We prove that the formulation satisfies the discrete inf-sup condition, we prove an optimal a priori error estimate for both problems. The formulation is then extended to the coupled case using a Nitsche-type weak formulation allowing for different meshes in the two subdomains. Finally, we present some numerical examples verifying the theoretical predictions and showing the flexibility of the coupled approach.     

On Meyniel's conjecture of the cop number

Meyniel conjectured that the cop number c(G) of any connected graph G on n vertices is at most for some constant C. In this article, we prove Meyniel's conjecture in special cases that G has diameter 2 or G is a bipartite graph of diameter 3. For general connected graphs, we prove , improving the best previously known upper‐bound O(n/ lnn) due to Chiniforooshan.     

On the n-body problem on surfaces of revolution

We explore the n-body problem, $n\ge 3$, on a surface of revolution with a general interaction depending on the pairwise geodesic distance. Using the geometric methods of classical mechanics we determine a large set of properties. In particular, we show that Saari's conjecture fails on surfaces of revolution admitting a geodesic circle. We define homographic motions and, using the discrete symmetries, prove that when the masses are equal, they form an invariant manifold. On this manifold the dynamics are reducible to a one-degree of freedom system. We also find that for attractive interactions, regular n-gon shaped relative equilibria with trajectories located on geodesic circles typically experience a pitchfork bifurcation. Some applications are included.     

A generalization of Mühlbach's extension principle for determinantal identities

Mühlbach's extension principle for determinantal identities generalizes Muir's law of extensible minors. Some particular issues with Mühlbach–Beckermann's identity [A general determinantal identity of Sylvester type and some applications, Linear Algebra Appl. 197, 198 (1994), pp. 93–112] led to the conjecture of a more general extension method than Mühlbach's. However, no confirmation seems to have been reported so far. In this note, we present a generalization of Mühlbach's extension principle which confirms that conjecture. The whole identity of Mühlbach–Beckermann is put in a simpler form from which a new interpretation as an extension of Leibniz's definition of a determinant.     

Schanuel's Conjecture and Algebraic Roots of Exponential Polynomials

In this article, I will prove that assuming Schanuel's conjecture, an exponential polynomial with algebraic coefficients can have only finitely many algebraic roots. Furthermore, this proof demonstrates that there are no unexpected algebraic roots of any such exponential polynomial. This implies a special case of Shapiro's conjecture: if p(x) and q(x) are two exponential polynomials with algebraic coefficients, each involving only one iteration of the exponential map, and they have common factors only of the form exp (g) for some exponential polynomial g, then p and q have only finitely many common zeros.     

Alternating sums over π-subgroups

Dade's conjecture predicts that if p is a prime, then the number of irreducible characters of a finite group of a given p-defect is determined by local subgroups. In this paper we replace p by a set of primes π and prove a π-version of Dade's conjecture for π-separable groups. This extends the (known) p-solvable case of the original conjecture and relates to a π-version of Alperin's weight conjecture previously established by the authors.     

Some Remarks on Syzygies of Adjoint Line Bundles

In this article, we construct examples of n-folds X carrying an ample line bundle A ∈ Pic X such that property N _p fails for K _X  + (n + 1 + p)A. This shows that the condition of Mukai's conjecture is optimal for every n ≥ 1 and p ≥ 0.     

Leading coefficients of Morris type constant term identities

The Morris constant term identity is known to be equivalent to the famous Selberg integral. In this paper, we regard Morris type constant terms as polynomials of a certain parameter. Thus, we can take the leading coefficients and obtain new identities. These identities happen to be crucial in finding lower bounds for cardinalities of some restricted sumsets, and in calculating the volume of a Tesler polytope.     

Variations on cops and robbers

We consider several variants of the classical Cops and Robbers game. We treat the version where the robber can move R≥1 edges at a time, establishing a general upper bound of , where α = 1 + 1/R, thus generalizing the best known upper bound for the classical case R = 1 due to Lu and Peng, and Scott and Sudakov. We also show that in this case, the cop number of an n‐vertex graph can be as large as n^{1 ? 1/(R ? 2)} for finite R≥5, but linear in n if R is infinite. For R = 1, we study the directed graph version of the problem, and show that the cop number of any strongly connected digraph on n vertices is O(n(loglogn)²/logn). Our approach is based on expansion. © 2011 Wiley Periodicals, Inc. J Graph Theory.     

Improvements on Hippchen's conjecture

Let G be a k-connected graph on n vertices. Hippchen's Conjecture (2008) states that two longest paths in G share at least k vertices. Gutiérrez (2020) recently proved the conjecture when $k\le 4$ or $k\ge \frac{n?2}{3}$. We improve upon both results; namely, we show that two longest paths in G share at least k vertices when $k=5$ or $k\ge \frac{n+2}{5}$. This completely resolves two conjectures by Gutiérrez in the affirmative.     

一些关于Chebyshef多项式以及它们应用的恒等式(英文)

本文研究了Chebyshef多项式的一类幂和问题.利用初等方法以及Chebyshef多项式的性质,获得了一些有趣的恒等式,推广了Melham关于Lucas数的奇数次幂和的猜想.     

Book review

Hypergeometric series identities are revisited systematically by means of Abel's method on summation by parts. Several new formulae and transformations are also established. The author is convinced that Abel's method on summation by parts is a natural choice in dealing with classical hypergeometric series.