Skew Pieri rules for Hall–Littlewood functions

We produce skew Pieri rules for Hall–Littlewood functions in the spirit of Assaf and McNamara (J. Comb. Theory Ser. A 118(1):277–290, 2011). The first two were conjectured by the first author (Konvalinka in J. Algebraic Comb. 35(4):519–545, 2012). The key ingredients in the proofs are a q-binomial identity for skew partitions and a Hopf algebraic identity that expands products of skew elements in terms of the coproduct and the antipode.     

On a q-analogue for Bernoulli numbers

Inspired by Borwein et al. (Am. Math. Mon., 116(5):387–412, 2009), we define a sequence of q-analogues for the Bernoulli numbers under the framework of Strodt operators. We show that they not only satisfy identities similar to those of the q-analogue proposed by Carlitz (Duke Math. J., 15(4):987–1000, 1948), but also interesting analytical properties as functions of q. In particular, we give a simple analytic proof of a generalization of an explicit formula for the Bernoulli numbers given by Woon (Math. Mag., 70(1):51–56, 1997). We also define a set of q-analogues for the Stirling numbers of the second kind within our framework and prove a q-extension of a related, well-known closed form relating Bernoulli and Stirling numbers.     

Multivariate generalized Bernstein polynomials: identities for orthogonal polynomials of two variables

We introduce polynomials $B^n_{k}(\boldmath{x};\omega|q)$ of total degree n, where $\boldmath{k} = (k_1,\ldots,k_d)\in\mathbb N_0^d, \; 0\le k_1+\ldots+k_d\le n$ , and $\boldmath{x}=(x_1,x_2,\ldots,x_d)\in\mathbb R^d$ , depending on two parameters q and ω, which generalize the multivariate classical and discrete Bernstein polynomials. For ω=0, we obtain an extension of univariate q-Bernstein polynomials, introduced by Phillips (Ann Numer Math 4:511–518, 1997). Basic properties of the new polynomials are given, including recurrence relations, q-differentiation rules and de Casteljau algorithm. For the case d=2, connections between $B^n_{k}(\boldmath{x};\omega|q)$ and bivariate orthogonal big q-Jacobi polynomials—introduced recently by the first two authors—are given, with the connection coefficients being expressed in terms of bivariate q-Hahn polynomials. As limiting forms of these relations, we give connections between bivariate q-Bernstein and Dunkl’s (little) q-Jacobi polynomials (SIAM J Algebr Discrete Methods 1:137–151, 1980), as well as between bivariate discrete Bernstein and Hahn polynomials.     

Foulkes characters, Eulerian idempotents, and an amazing matrix

John Holte (Am. Math. Mon. 104:138?C149, 1997) introduced a family of ??amazing matrices?? which give the transition probabilities of ??carries?? when adding a list of numbers. It was subsequently shown that these same matrices arise in the combinatorics of the Veronese embedding of commutative algebra (Brenti and Welker, Adv. Appl. Math. 42:545?C556, 2009; Diaconis and Fulman, Am. Math. Mon. 116:788?C803, 2009; Adv. Appl. Math. 43:176?C196, 2009) and in the analysis of riffle shuffling (Diaconis and Fulman, Am. Math. Mon. 116:788?C803, 2009; Adv. Appl. Math. 43:176?C196, 2009). We find that the left eigenvectors of these matrices form the Foulkes character table of the symmetric group and the right eigenvectors are the Eulerian idempotents introduced by Loday (Cyclic Homology, 1992) in work on Hochschild homology. The connections give new closed formulae for Foulkes characters and allow explicit computation of natural correlation functions in the original carries problem.     

A tableau formula for eta polynomials

We use the Pieri and Giambelli formulas of Buch et al. (Invent Math 178:345–405, 2009; J Reine Angew, 2013) and the calculus of raising operators developed in Buch et al. (A Giambelli formula for isotropic Grassmannians, arXiv:0811.2781, 2008) and Tamvakis (J Reine Angew Math 652, 207–244, 2011) to prove a tableau formula for the eta polynomials of Buch et al. (J Reine Angew, 2013) and the Stanley symmetric functions which correspond to Grassmannian elements of the Weyl group $\widetilde{W}_n$ of type $\text {D}_n$ . We define the skew elements of $\widetilde{W}_n$ and exhibit a bijection between the set of reduced words for any skew $w\in \widetilde{W}_n$ and a set of certain standard typed tableaux on a skew shape $\lambda /\mu $ associated to $w$ .     

On isotopisms and strong isotopisms of commutative presemifields

In this paper we prove that the P(q,?) (q odd prime power and ?>1 odd) commutative semifields constructed by Bierbrauer (Des. Codes Cryptogr. 61:187?C196, 2011) are isotopic to some commutative presemifields constructed by Budaghyan and Helleseth (SETA, pp.?403?C414, 2008). Also, we show that they are strongly isotopic if and only if q??1(mod?4). Consequently, for each q???1(mod?4) there exist isotopic commutative presemifields of order q ^2? (?>1 odd) defining CCZ-inequivalent planar DO polynomials.     

Generalized qd algorithm for block band matrices

The generalized qd algorithm for block band matrices is an extension of the block qd algorithm applied to a block tridiagonal matrix. This algorithm is applied to a positive definite symmetric block band matrix. The result concerning the behavior of the eigenvalues of the first and the last diagonal block of the matrix containing the entries q ^(k) which was obtained in the tridiagonal case is still valid for positive definite symmetric block band matrices. The eigenvalues of the first block constitute strictly increasing sequences and those of the last block constitute strictly decreasing sequences. The theorem of convergence, given in Draux and Sadik (Appl Numer Math 60:1300?C1308, 2010), also remains valid in this more general case.     

Averaging Fluctuations in Resolvents of Random Band Matrices

We consider a general class of random matrices whose entries are centred random variables, independent up to a symmetry constraint. We establish precise high-probability bounds on the averages of arbitrary monomials in the resolvent matrix entries. Our results generalize the previous results of Erd?s et al. (Ann Probab, arXiv:1103.1919, 2013; Commun Math Phys, arXiv:1103.3869, 2013; J Combin 1(2):15–85, 2011) which constituted a key step in the proof of the local semicircle law with optimal error bound in mean-field random matrix models. Our bounds apply to random band matrices and improve previous estimates from order 2 to order 4 in the cases relevant to applications. In particular, they lead to a proof of the diffusion approximation for the magnitude of the resolvent of random band matrices. This, in turn, implies new delocalization bounds on the eigenvectors. The applications are presented in a separate paper (Erd?s et al., arXiv:1205.5669, 2013).     

Kazhdan–Lusztig polynomials of boolean elements

We give closed combinatorial product formulas for Kazhdan–Lusztig polynomials and their parabolic analogue of type q in the case of boolean elements, introduced in (Marietti in J. Algebra 295:1–26, 2006), in Coxeter groups whose Coxeter graph is a tree. Such formulas involve Catalan numbers and use a combinatorial interpretation of the Coxeter graph of the group. In the case of classical Weyl groups, this combinatorial interpretation can be restated in terms of statistics of (signed) permutations. As an application of the formulas, we compute the intersection homology Poincaré polynomials of the Schubert varieties of boolean elements.     

Computing Final Polynomials and Final Syzygies Using Buchberger’s Gröbner Bases Method

Final polynomials and final syzygies provide an explicit representation of polynomial identities promised by Hilbert’s Nullstellensatz. Such representations have been studied independently by Bokowski [2,3,4] and Whiteley [23,24] to derive invariant algebraic proofs for statements in geometry. In the present paper we relate these methods to some recent developments in computational algebraic geometry. As the main new result we give an algorithm based on B. Buchberger’s Gröbner bases method for computing final polynomials and final syzygies over the complex numbers. Degree upper bound for final polynomials are derived from theorems of Lazard and Brownawell, and a topological criterion is proved for the existence of final syzygies. The second part of this paper is expository and discusses applications of our algorithm to real projective geometry, invariant theory and matrix theory.     

Constant Term Methods in the Theory of Tesler Matrices and Macdonald Polynomial Operators

The Tesler matrices with hook sums (a ₁, a ₂, . . . , a _n ) are non-negative integral upper triangular matrices, whose i ^th diagonal element plus the sum of the entries in the arm of its (french) hook minus the sum of the entries in its leg is equal to a _i for all i. In a recent paper [6], the second author expressed the Hilbert series of the Diagonal Harmonic modules as a weighted sum of the family of Tesler matrices with hook weights (1, 1, . . . , 1). In this paper we use the constant term algorithm developed by the third author to obtain a Macdonald polynomial interpretation of these weighted sum of Tesler matrices for arbitrary hook weights. In particular, we also obtain new and illuminating proofs of the results in [6].     

On the functional codes defined by quadrics and Hermitian varieties

In recent years, functional codes have received much attention. In his PhD thesis, F.A.B. Edoukou investigated various functional codes linked to quadrics and Hermitian varieties defined in finite projective spaces (Edoukou, PhD Thesis, 2007). This work was continued in (Edoukou et al., Des Codes Cryptogr 56:219–233, 2010; Edoukou et al., J Pure Appl Algebr 214:1729–1739, 2010; Hallez and Storme, Finite Fields Appl 16:27–35, 2010), where the results of the thesis were improved and extended. In particular, Hallez and Storme investigated the functional codes ${C_2(\mathcal{H})}$ , with ${\mathcal{H}}$ a non-singular Hermitian variety in PG(N, q ²). The codewords of this code are defined by evaluating the points of ${\mathcal{H}}$ in the quadratic polynomials defined over ${\mathbb{F}_{q^2}}$ . We now present the similar results for the functional code ${C_{Herm}(\mathcal{Q})}$ . The codewords of this code are defined by evaluating the points of a non-singular quadric ${\mathcal{Q}}$ in PG(N, q ²) in the polynomials defining the Hermitian varieties of PG(N, q ²).     

Bounds of Singular Integrals on Weighted Hardy Spaces and Discrete Littlewood–Paley Analysis

We apply the discrete version of Calderón??s reproducing formula and Littlewood?CPaley theory with weights to establish the $H^{p}_{w} \to H^{p}_{w}$ (0<p<??) and $H^{p}_{w}\to L^{p}_{w}$ (0<p??1) boundedness for singular integral operators and derive some explicit bounds for the operator norms of singular integrals acting on these weighted Hardy spaces when we only assume w??A _??. The bounds will be expressed in terms of the A _q constant of w if q>q _w =inf?{s:w??A _s }. Our results can be regarded as a natural extension of the results about the growth of the A _p constant of singular integral operators on classical weighted Lebesgue spaces $L^{p}_{w}$ in Hytonen et al. (arXiv:1006.2530, 2010; arXiv:0911.0713, 2009), Lerner (Ill.?J.?Math. 52:653?C666, 2008; Proc. Am. Math. Soc. 136(8):2829?C2833, 2008), Lerner et?al. (Int.?Math. Res. Notes 2008:rnm 126, 2008; Math. Res. Lett. 16:149?C156, 2009), Lacey et?al. (arXiv:0905.3839v2, 2009; arXiv:0906.1941, 2009), Petermichl (Am. J. Math. 129(5):1355?C1375, 2007; Proc. Am. Math. Soc. 136(4):1237?C1249, 2008), and Petermichl and Volberg (Duke Math. J. 112(2):281?C305, 2002). Our main result is stated in Theorem?1.1. Our method avoids the atomic decomposition which was usually used in proving boundedness of singular integral operators on Hardy spaces.     

The Totally Nonnegative Part of G/P is a CW Complex

The totally nonnegative part of a partial ag variety G/P has been shown in [18], [17] to be a union of semialgebraic cells. Moreover, the closure of a cell was shown in [19] to be a union of smaller cells. In this paper we provide glueing maps for each of the cells to prove that (G/P)_?0 is a CW complex. This generalizes a result of Postnikov, Speyer and the second author [15] for Grassmannians.     

Asymptotics of q-plancherel measures

In this paper, we are interested in the asymptotic size of the rows and columns of a random Young diagram under a natural deformation of the Plancherel measure coming from Hecke algebras. The first lines of such diagrams are typically of order n, so it does not fit in the context of the work of Biane (Int Math Res Notices 4:179–192, 2001) and ?niady (Probab. Theory Relat Fields 136:263–297, 2006). Using the theory of polynomial functions on Young diagrams of Kerov and Olshanski, we are able to compute explicitly the first- and second-order asymptotics of the length of the first rows. Our method also works for other measures, for example those coming from Schur–Weyl representations.     

A Characterization of the Finite Veronesean by Intersection Properties

A combinatorial characterization of the Veronese variety of all quadrics in PG(n, q) by means of its intersection properties with respect to subspaces is obtained. The result relies on a similar combinatorial result on the Veronesean of all conics in the plane PG(2, q) by Ferri [Atti Accad. Naz. Lincei Rend. 61(6), 603?C610 (1976)], Hirschfeld and Thas [General Galois Geometries. Oxford University Press, New York (1991)], and Thas and Van Maldeghem [European J. Combin. 25(2), 275?C285 (2004)], and a structural characterization of the quadric Veronesean by Thas and Van Maldeghem [Q. J. Math. 55(1), 99?C113 (2004)].     

Information sets in abelian codes: defining sets and Groebner basis

In Bernal and Simón (IEEE Trans Inf Theory 57(12):7990–7999, 2011) we introduced a technique to construct information sets for every semisimple abelian code by means of its defining set. This construction is a non trivial generalization of that given by Imai (Inf Control 34:1–21, 1977) in the case of binary two-dimensional cyclic (TDC) codes. On the other hand, Sakata (IEEE Trans Inf Theory IT-27(5):556–565, 1981) showed a method for constructing information sets for binary TDC codes based on the computation of Groebner basis which agrees with the information set obtained by Imai. Later, Chabanne (IEEE Trans Inf Theory 38(6):1826–1829, 1992) presents a generalization of the permutation decoding algorithm for binary abelian codes by using Groebner basis, and as a part of his method he constructs an information set following the same ideas introduced by Sakata. In this paper we show that, in the general case of q-ary multidimensional abelian codes, both methods, that based on Groebner basis and that defined in terms of the defining sets, also yield the same information set.     

Small tight sets of hyperbolic quadrics

An x-tight set of a hyperbolic quadric Q ⁺(2n + 1, q) can be described as a set M of points with the property that the number of points of M in the tangent hyperplanes of points of M is as big as possible. We show that such a set is necessarily the union of x mutually disjoint generators provided that x ≤ q and n ≤ 3, or that x < q, n ≥ 4 and q ≥ 71. This unifies and generalizes many results on x-tight sets that are presently known, see (J Comb Theory Ser A 114(7):1293–1314 [1], J Comb Des 16(4):342–349 [5], Des Codes Cryptogr 50:187–201 [4], Adv Geom 4(3):279–286 [8], Bull Lond Math Soc 42(6):991–996 [11]).     

Bilinear Forms and Fierz Identities for Real Spin Representations

Given a real representation of the Clifford algebra corresponding to ${\mathbb{R}^{p+q}}$ with metric of signature (p, q), we demonstrate the existence of two natural bilinear forms on the space of spinors. With the Clifford action of k-forms on spinors, the bilinear forms allow us to relate two spinors with elements of the exterior algebra. From manipulations of a rank four spinorial tensor introduced in [1], we are able to find a general class of identities which, upon specializing from four spinors to two spinors and one spinor in signatures (1,3) and (10,1), yield some well-known Fierz identities. We will see, surprisingly, that the identities we construct are partly encoded in certain involutory real matrices that resemble the Krawtchouk matrices [2][3].     

Moment Approximations for Set-Semidefinite Polynomials

The set of polynomials that are nonnegative over a subset of the nonnegative orthant (we call them set-semidefinite) have many uses in optimization. A common example of this type set is the set of copositive matrices, where we are effectively considering nonnegativity over the entire nonnegative orthant and are restricted to homogeneous polynomials of degree two. Lasserre (SIAM J. Optim., 21(3):864–885, 2011) has previously considered a method using moments in order to provide an outer approximation to this set, for nonnegativity over a general subset of the real space. In this paper, we shall show that, in the special case of considering nonnegativity over a subset of the nonnegative orthant, we can provide a new outer approximation hierarchy. This is based on restricting moment matrices to be completely positive, and it is at least as good as Lasserre’s method. This can then be relaxed to give tractable approximations that are still at least as good as Lasserre’s method. In doing this, we also provide interesting new insights into the use of moments in constructing these approximations.