Searcharxiv⌕ Search

arXiv subjects

Christian Krattenthaler

Publications and source records attributed to Christian Krattenthaler.

At least 127 records · Page 7Linked to original sources
arXiv2001

On multiplicities of points on Schubert varieties in Graszmannians II

We prove a conjecture by Kreiman and Lakshmibai on a combinatorial description of multiplicities of points on Schubert varieties in Graszmannians in terms of certain sets of reflections in the corresponding Weyl group. The proof is accomplished by setting up a bijection between these sets of reflections and the author's previous combinatorial interpretation of these multiplicities in terms of nonintersecting lattice paths (Séminaire Lotharingien Combin. 45 (2001), Article B45c; see http://www.mat.univie.ac.at/~slc/wpapers/s45kratt.html or http://www.arxiv.org/abs/math.AG/0011129).

math.AG↗
arXiv2001

A determinantal formula for the Hilbert series of one-sided ladder determinantal rings

We give a formula that expresses the Hilbert series of one-sided ladder determinantal rings, up to a trivial factor, in form of a determinant. This allows the convenient computation of these Hilbert series. The formula follows from a determinantal formula for a generating function for families of nonintersecting lattice paths that stay inside a one-sided ladder-shaped region, in which the paths are counted with respect to turns.

math.AC↗
arXiv2001

Evaluations of some determinants of matrices related to the Pascal triangle

We prove several evaluations of determinants of matrices, the entries of which are given by the recurrence $a_{i,j}=a_{i-1,j}+a_{i,j-1}$, or variations thereof. These evaluations were either conjectured or extend conjectures by Roland Bacher [J. Théorie Nombres Bordeaux 13 (2001), to appear; see http://arxiv.org/abs/math.CO/0109013].

math.CO↗
arXiv2001

A (conjectural) 1/3-phenomenon for the number of rhombus tilings of a hexagon which contain a fixed rhombus

We state, discuss, provide evidence for, and prove in special cases the conjecture that the probability that a random tiling by rhombi of a hexagon with side lengths $2n+a,2n+b,2n+c,2n+a,2n+b,2n+c$ contains the (horizontal) rhombus with coordinates $(2n+x,2n+y)$ is equal to ${1/3} + g_{a,b,c,x,y}(n) {\binom {2n}{n}}^3 / \binom {6n}{3n}$, where $g_{a,b,c,x,y}(n)$ is a rational function in $n$. Several specific instances of this "1/3-phenomenon" are made explicit.

math.CO↗
arXiv2001

The Hilbert Series of Pfaffian Rings

We give three determinantal expressions for the Hilbert series as well as the Hilbert function of a Pfaffian ring, and a closed form product formula for its multiplicity. An appendix outlining some basic facts about degeneracy loci and applications to multiplicity formulae for Pfaffian rings is also included.

math.AC↗
arXiv2001

Enumeration of lozenge tilings of hexagons with cut off corners

Motivated by the enumeration of a class of plane partitions studied by Proctor and by considerations about symmetry classes of plane partitions, we consider the problem of enumerating lozenge tilings of a hexagon with ``maximal staircases'' removed from some of its vertices. The case of one vertex corresponds to Proctor's problem. For two vertices there are several cases to consider, and most of them lead to nice enumeration formulas. For three or more vertices there do not seem to exist nice product formulas in general, but in one special situation a lot of factorization occurs, and we pose the problem of finding a formula for the number of tilings in this case.

math.CO↗
arXiv2000

On multiplicities of points on Schubert varieties in Grassmannians

We answer some questions related to multiplicity formulas by Rosenthal and Zelevinsky and by Lakshmibai and Weyman for points on Schubert varieties in Grassmannians. In particular, we give combinatorial interpretations in terms of nonintersecting lattice paths of these formulas, which makes the equality of the two formulas immediately obvious. Furthermore we provide an alternative determinantal formula for these multiplicities, and we show that they count semistandard tableaux of unusual shapes.

math.AG↗
arXiv2000

Vicious walkers, friendly walkers and Young tableaux II: With a wall

We derive new results for the number of star and watermelon configurations of vicious walkers in the presence of an impenetrable wall by showing that these follow from standard results in the theory of Young tableaux, and combinatorial descriptions of symmetric functions. For the problem of $n$-friendly walkers, we derive exact asymptotics for the number of stars and watermelons both in the absence of a wall and in the presence of a wall.

cond-mat.stat-mech↗
arXiv2000

ad-nilpotent $\frak b$-ideals in sl(n) having a fixed class of nilpotence: combinatorics and enumeration

We study the combinatorics of ad-nilpotent ideals of a Borel subalgebra of $sl(n+1,\Bbb C)$. We provide an inductive method for calculating the class of nilpotence of these ideals and formulas for the number of ideals having a given class of nilpotence. We study the relationships between these results and the combinatorics of Dyck paths, based upon a remarkable bijection between ad-nilpotent ideals and Dyck paths. Finally, we propose a (q,t)-analogue of the Catalan number $C_n$. These (q,t)-Catalan numbers count on the one hand ad-nilpotent ideals with respect to dimension and class of nilpotence, and on the other hand admit interpretations in terms of natural statistics on Dyck paths.

math.RA↗
arXiv2000

Rectangular Scott-type Permanents

Let $x_1,x_2,...,x_n$ be the zeroes of a polynomial P(x) of degree n and $y_1,y_2,...,y_m$ be the zeroes of another polynomial Q(y) of degree m. Our object of study is the permanent $\per(1/(x_i-y_j))_{1\le i\le n, 1\le j\le m}$, here named "Scott-type" permanent, the case of $P(x)=x^n-1$ and $Q(y)=y^n+1$ having been considered by R. F. Scott. We present an efficient approach to determining explicit evaluations of Scott-type permanents, based on generalizations of classical theorems by Cauchy and Borchardt, and of a recent theorem by Lascoux. This continues and extends the work initiated by the first author ("Généralisation de l'identité de Scott sur les permanents," to appear in Linear Algebra Appl.). Our approach enables us to provide numerous closed form evaluations of Scott-type permanents for special choices of the polynomials P(x) and Q(y), including generalizations of all the results from the above mentioned paper and of Scott's permanent itself. For example, we prove that if $P(x)=x^n-1$ and $Q(y)=y^{2n}+y^n+1$ then the corresponding Scott-type permanent is equal to $(-1)^{n+1}n!$.

math.RA↗
arXiv2000

Permutations with restricted patterns and Dyck paths

We exhibit a bijection between 132-avoiding permutations and Dyck paths. Using this bijection, it is shown that all the recently discovered results on generating functions for 132-avoiding permutations with a given number of occurrences of the pattern $12... k$ follow directly from old results on the enumeration of Motzkin paths, among which is a continued fraction result due to Flajolet. As a bonus, we use these observations to derive further results and a precise asymptotic estimate for the number of 132-avoiding permutations of $\{1,2,...,n\}$ with exactly $r$ occurrences of the pattern $12... k$. Second, we exhibit a bijection between 123-avoiding permutations and Dyck paths. When combined with a result of Roblet and Viennot, this bijection allows us to express the generating function for 123-avoiding permutations with a given number of occurrences of the pattern $(k-1)(k-2)... 1k$ in form of a continued fraction and to derive further results for these permutations.

math.CO↗
arXiv1999

Bijections for hook pair identities

Short, bijective proofs of identities for multisets of `hook pairs' (arm-leg pairs) of the cells of certain diagrams are given. These hook pair identities were originally found by Regev.

math.CO↗
arXiv1999

Advanced Determinant Calculus

The purpose of this article is threefold. First, it provides the reader with a few useful and efficient tools which should enable her/him to evaluate nontrivial determinants for the case such a determinant should appear in her/his research. Second, it lists a number of such determinants that have been already evaluated, together with explanations which tell in which contexts they have appeared. Third, it points out references where further such determinant evaluations can be found.

math.CO↗
arXiv1999

Asymptotic Redundancies for Universal Quantum Coding

We investigate the question of whether or not there exists a noncommutative/ quantum extension of a recent (commutative probabilistic) result of Clarke and Barron. They demonstrated that the Jeffreys' invariant prior of Bayesian theory yields the common asymptotic (minimax and maximin) redundancy - the excess of the encoding cost over the source entropy - of universal data compression in a parametric setting. We study certain probability distributions for the two-level quantum systems. We are able to compute exact formulas for the corresponding redundancies, for which we find the asymptotic limits. These results are very suggestive and do indeed point towards a possible quantum extension of the result of Clarke and Barron.

quant-ph↗
arXiv1998

Gauss Sums, Jacobi Sums, and $p$-ranks of Cyclic Difference Sets

We study quadratic residue difference sets, GMW difference sets, and difference sets arising from monomial hyperovals, all of which are $(2^d-1, 2^{d-1}-1, 2^{d-2}-1)$ cyclic difference sets in the multiplicative group of the finite field $F_{2^d}$ of $2^d$ elements, with $d \geq 2$. We show that, except for a few cases with small $d$, these difference sets are all pairwise inequivalent. This is accomplished in part by examining their 2-ranks. The 2-ranks of all of these difference sets were previously known, except for those connected with the Segre and Glynn hyperovals. We determine the 2-ranks of the difference sets arising from the Segre and Glynn hyperovals, in the following way. Stickelberger's theorem for Gauss sums is used to reduce the computation of these 2-ranks to a problem of counting certain cyclic binary strings of length $d$. This counting problem is then solved combinatorially, with the aid of the transfer matrix method. We give further applications of the 2-rank formulas, including the determination of the nonzeros of certain binary cyclic codes, and a criterion in terms of the trace function to decide for which $β$ in $F_{2^d}^*$ the polynomial $x^6 + x + β$ has a zero in $F_{2^d}$, when $d$ is odd.

math.CO↗