Related papers: Jack Derangements

We prove multiplicative congruences mod $2^{12}$ for George Andrews's partition function, $\overline{\mathcal{EO}}(n)$, the number of partitions of $n$ in which every even part is less than each odd part and only the largest even part…

It is known that a graph isomorphism testing algorithm is polynomially equivalent to a detecting of a graph non-trivial automorphism algorithm. The polynomiality of the latter algorithm, is obtained by consideration of symmetry properties…

Let $k \leq n$ be nonnegative integers and let $\lambda$ be a partition of $k$. S. Griffin recently introduced a quotient $R_{n,\lambda}$ of the polynomial ring $\mathbb{Q}[x_1, \dots, x_n]$ in $n$ variables which simultaneously generalizes…

Two evaluation formulas are derived for the Jack superpolynomials. The evaluation formulas are expressed in terms of products of fillings of skew diagrams. One of these formulas is nothing but the evaluation formula of the Jack polynomials…

Let G=(V,E) be an undirected graph, lambda_k be the k-th smallest eigenvalue of the normalized laplacian matrix of G. There is a basic fact in algebraic graph theory that lambda_k > 0 if and only if G has at most k-1 connected components.…

For each pair of positive integers (k,r) such that k+1,r-1 are coprime, we introduce an ideal $I^{(k,r)}_n$ of the ring of symmetric polynomials. The ideal $I^{(k,r)}_n$ has a basis consisting of Jack polynomials with parameter…

This paper studies automorphisms and monomorphisms of direct products $\Gamma=\Gamma_1\times\cdots\times\Gamma_r$ of finitely generated virtually solvable minimax groups, a class containing all virtually polycyclic groups. Under an…

Let $G$ be a finite simple graph with edge ideal $I(G)$. Let $J(G)$ denote the Alexander dual of $I(G)$. We show that a description of all induced cycles of odd length in $G$ is encoded in the associated primes of $J(G)^2$. This result…

We introduce several commutative rings, the snake rings, that have strong connections to cluster algebras. The elements of these rings are residue classes of unions of certain labeled graphs that were used to construct canonical bases in…

We introduce and study a variant of the family of Johnson graphs, the Full-Flag Johnson graphs. We show that Full-Flag Johnson graphs are Cayley graphs on S_n generated by certain classes of permutations, and that they are in fact…

Motivated by circle graphs, and the enumeration of Euler circuits, we define a one-variable ``interlace polynomial'' for any graph. The polynomial satisfies a beautiful and unexpected reduction relation, quite different from the cut and…

We introduce a new operator $\Gamma$ on symmetric functions, which enables us to obtain a creation formula for Macdonald polynomials. This formula provides a connection between the theory of Macdonald operators initiated by Bergeron,…

There are nontrivial dualities and parallels between polynomial algebras and the Grassmann algebras. This paper is an attempt to look at the Grassmann algebras at the angle of the Jacobian conjecture for polynomial algebras (which is the…

We present an integral product formula for Jack polynomials of two variables, extending that of zonal polynomials. It provides another way to find the explicit integral representation for the generalized Bessel function of type $ B_2 $, as…

A Hamilton cycle in a graph $\Gamma$ is a cycle passing through every vertex of $\Gamma$. A Hamiltonian decomposition of $\Gamma$ is a partition of its edge set into disjoint Hamilton cycles. One of the oldest results in graph theory is…

In this paper, we discuss the relations between the Jack polynomials, $\hbar$-dependent KP hierarchy and affine Yangian of ${\mathfrak{gl}}(1)$. We find that $\alpha=\hbar^2$ and $h_1=\hbar, \ h_2=-\hbar^{-1}$, where $\alpha$ is the…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

This paper proves a matrix model for the Wishart Ensemble with general covariance and general dimension parameter beta. In so doing, we introduce a new and elegant definition of Jack polynomials.

Suppose that $\theta$ is irrational. Then almost all elements $\nu\in {\mathbb Z}[\theta]$ that may be written as a $k$-fold product of the shifted integers $n+\theta$ $(n\in {\mathbb N})$ are thus represented essentially uniquely.

We prove that, for any finite set $A \subset \mathbb Q$ with $|AA| \leq K|A|$ and any positive integer $k$, the $k$-fold product set of the shift $A+1$ satisfies the bound $$| \{(a_1+1)(a_2+1) \cdots (a_k+1) : a_i \in A \}| \geq…