Related papers: The Jack Daniels Problem

In 1972, P.W.Anderson suggested that `More is Different', meaning that complex physical systems may exhibit behavior that cannot be understood only in terms of the laws governing their microscopic constituents. We strengthen this claim by…

The main theorem (2.2) consists in two characterizations of isomorphisms of factorial domains in terms of prime or primary rings elements, and unramified, flat or weakly injective affine schemes morphisms. In order to apply this theorem to…

Baksalary and Hauke introduced the diamond partial order in 1990, which we revisit in this paper. This order was defined on the set of rectangular matrices and is the same as the star and minus partial orders for partial isometries. New…

According to the Wagstaff heuristic, the probability that a Mersenne number $M_p = 2^p-1$ is prime mainly depends on the size of the exponent $p$. We investigate whether the secondary arithmetic structure in $p-1$ is linked to noticeable…

Let G be a powerful finite p-group. In this note, we give a short elementary proof of the following facts for all $i\ge 0$: (i) $\exp \Omega_-i(G)\le p^i$ for odd p, and $\exp \Omega_-i(G)\le 2^{i+1}$ for p = 2; (ii) the index $|G:G^{p^i}|$…

Let \(d_k(p)\) denote the natural density of positive integers whose \(k\)-th smallest prime divisor is \(p\). Erd\H{o}s asked whether, for each fixed \(k\), the sequence \(p\mapsto d_k(p)\) is unimodal as \(p\) ranges over the primes.…

In the present paper, we provide results that relate the Jacobi polynomials in genus $g$. We show that if a code is $t$-homogeneous that is, the codewords of the code for every given weight hold a $t$-design, then its Jacobi polynomial in…

In 1878, Jordan proved that if a finite group $G$ has a faithful representation of dimension $n$ over $\mathbb{C}$, then $G$ has a normal abelian subgroup with index bounded above by a function of $n$. The same result fails if one replaces…

Symmetric Jack polynomials arise naturally in several contexts, including statistics, physics, combinatorics, and representation theory. They are pairwise orthogonal with repsect to two different inner products, the first defined by…

The "Capelli problem" for the symmetric pairs $(\mathfrak{gl}\times \mathfrak{gl},\mathfrak{gl})$ $(\mathfrak{gl},\mathfrak{o})$, and $(\mathfrak{gl},\mathfrak{sp})$ is closely related to the theory of Jack polynomials and shifted Jack…

In a polynomial ring over a perfect field, the symbolic powers of a prime ideal can be described via differential operators: a classical result by Zariski and Nagata says that the $n$-th symbolic power of a given prime ideal consists of the…

Superpolynomials consist of commuting and anti-commuting variables. By considering the anti-commuting variables as a module of the symmetric group the theory of vector-valued nonsymmetric Jack polynomials can be specialized to…

This paper proposes a conjectural framework for Alperin's Main Problem of Block Theory from 1976. The character sets considered here are defined by nonvanishing at given elements, not only by degree conditions. From this point of view,…

The Calogero-Sutherland model occurs in a large number of physical contexts, either directly or via its eigenfunctions, the Jack polynomials. The supersymmetric counterpart of this model, although much less ubiquitous, has an equally rich…

Young's lattice $L(m,n)$ consists of partitions having $m$ parts of size at most $n$, ordered by inclusion of the corresponding Ferrers diagrams. K. O'Hara gave the first constructive proof of the unimodality of the Gaussian polynomials by…

Almost nothing is known about the parity of the partition function $p(n)$, which is conjectured to be random. Despite this expectation, Ono surprisingly proved the existence of infinitely many linear dependence congruence relations modulo 4…

Call a monic integer polynomial exceptional if it has a root modulo all but a finite number of primes, but does not have an integer root. We classify all irreducible monic integer polynomials $h$ for which there is an irreducible monic…

Many generating series of combinatorially interesting numbers have the property that the sum of the terms of order $<p$ at some suitable point is congruent to a zero of a zeta-function modulo infinitely many primes $p$. Surprisingly, very…

Given a prime number $p$, the study of divisibility properties of a sequence $c(n)$ has two contending approaches: $p$-adic valuations and superconcongruences. The former searches for the highest power of $p$ dividing $c(n)$, for each $n$;…

The shuffle lattice was introduced by Greene in 1988 as an idealized model for DNA mutation, when he revealed remarkable combinatorial properties of this structure. In this paper, we prove an explicit formula for the $M$-triangle of the…