SearcharxivSearch

arXiv subjects

Jan Snellman

Publications and source records attributed to Jan Snellman.

At least 19 recordsLinked to original sources

The coordinate ring of the k-fold iterated commutator locus for 2x2 matrices

For $2 \times 2$ matrices $A_1,\dots,A_k$, write $[A_1,\dots,A_k]$ for the left-normed iterated commutator $[\dots[[A_1,A_2],A_3],\dots,A_k]$, and $I_k$ for the ideal, in the $3k$-variable reduced-coordinate polynomial ring $R_k$, cutting out its vanishing locus. We prove, for every $k \geq 2$ over any field of characteristic $\neq 2$, and as four independently-established results rather than one bundled claim: $I_k$ has codimension 2; $I_k$ has exactly 3 minimal generators; $R_k / I_k$ is Cohen-Macaulay; and $I_k$ is radical. The last of these, together with an explicit component count resting on a non-containment argument, assembles into the Primary Decomposition Theorem: $I_k = P_2 \cap \cdots \cap P_k$ is an irredundant primary decomposition into exactly $k-1$ primes, following an explicit recursive block-involvement pattern. The proof identifies $I_k$ as the ideal of $2 \times 2$ minors of an explicit $2 \times 3$ matrix (a determinantal ideal, not merely one that looks determinantal), and invokes classical determinantal-ideal theory (Bruns-Vetter) and an explicit rank-2 Jacobian witness on every component (Serre's criterion) for the algebraic and radicality halves respectively.

math.AC

Truncations of the ring of number-theoretic functions, revisited

Let $K$ be a field containing $\mathbb{Q}$, let $\Gamma$ be the ring of all functions from the positive integers to $K$ under Dirichlet convolution, and let $\Gamma_n$ be its truncation to functions supported on $[1,n]$. In [Snellman, Homology Homotopy Appl. 2 (2000), 17-27; arXiv:math/9904143] it was shown that $\Gamma_n$ is a polynomial ring modulo a monomial ideal $I_n$ which is stable after reversing the order of the variables, and the Poincare-Betti series of $\Gamma_n$ was computed in terms of the numbers $C_{n,v}$ of minimal generators of $I_n$ of least support $v$. We prove that $C_{n,v} = \Phi(n,p_v)$, Legendre's sifting function: the number of integers in $[1,n]$ free of prime factors $\le p_v$. This identifies an invariant of a minimal free resolution with a classical object of sieve theory. As consequences we obtain: a proof of Conjecture 4.6 of the 2000 paper, which was left open there; the average order $C_n \sim \pi(n)^2/2$ of the total number of minimal generators, showing that the lower bound $C_n \ge \binom{\pi(n)+1}{2}$ of that paper is asymptotically sharp, together with the exact order $C_n - \binom{\pi(n)+1}{2} \sim \frac{16}{3} n^{3/2} / \log^3 n$ of the error; and the identification of $C_n$ with the OEIS sequence A182843. We also record errata for the 2000 paper: one stated result is false, and two proofs are incomplete. Corrected statements and complete proofs are given.

math.AC

On the directions occurring in lattice-line coverings of the integer plane

We consider families of lines that cover every point of the integer lattice $\mathbf{Z}^2$ in the plane, subject to the constraint that no two lines of different direction in the family meet at a lattice point. Restricting to \emph{lattice lines} (lines containing at least two, hence infinitely many, lattice points, equivalently of rational direction), we show that the set of directions occurring in such a covering can be made dense in the space of line directions. The construction is a recursive splitting of $\mathbf{Z}^2$ into nested rank-2 sublattice cosets, each handed off to a freshly chosen direction; the key technical point is a steering lemma showing that at every stage of the recursion a new direction arbitrarily close to any prescribed target can still be realized, via an elementary sieve bound.

math.CO

Greedy Regular Convolutions

We introduce a class of convolutions on arithmetical functions that are regular in the sense of of Narkiewicz, homogeneous in the sense of Burnett et al, and bounded, in the sense that there exists a common finite bound for the rank of primitive numbers. Among these "greedy convolutions" the unitary convolution and the "ternary convolution" are particularly interesting: they are the only regular, homogeneous convolutions where each primitive number have the same finite rank. While the greedy convolution of length 3, also described in detail, has primitive numbers of rank 3 and rank 1, it is still special in that the set of primitives can be generated by a simple recursive procedure that we name selective sifting.

math.NT

The Polytope of Probability Functions on a Finite Poset

Kim, Kim, and Neggers (2019) defined probability functions on a poset, by listing some very natural conditions that a function \(\pi: P \times P \to [0,1]\) should satisfy in order to capture the intuition of "the likelihood that \(a\) precedes \(b\) in \(P\)". In particular, this generalizes the common notion of poset probability for finite posets, where \(\pi(a,b)\) is the proportion of linear extensions of \(P\) in which \(a\) precedes \(b\). They constructed a family of such functions for posets embedded in the ordered plane; that is two say, for posets of order dimension at most two. We study probability functions of a finite poset \(P\) by constructing an ancillary poset \(\tilde{P}\), that we call *probability functions posets*. The relations of this new poset encodes the restrictions imposed on probability functions of the original poset by the conditions of the definition. Then, we define the probability functions polytope, which parameterizes the probability functions on \(P\), and show that it can be realized as the order polytope of \(\tilde{P}\) intersected by a certain affine subspace. We give a partial description of the vertices of probability functions polytope and show that, in contrast to the order polytope, it is not always a lattice polytope.

math.CO

Poset probability in two-row partition posets

We find explicit formulae for poset probabilities \(\mathbf{Prob}(P_\lambda; \alpha < \beta)\) in partition posets (cell posets) \(P_{\lambda}\) when \(\lambda=(\lambda_{1},\lambda_{2})\) is a two-row partition. These probabilities are given as rational expressions in \(f^{\sigma / \tau}\), where \(\tau \subseteq \sigma \subseteq \lambda\). We then use well-known formulae, such as the hook-length formula for \(f^\lambda\), the number of standard Young tableaux on a partition \(\lambda\), and the corresponding determinantal formula by Jacobi-Trudi-Aitken for \(f^{\lambda / \mu}\), the number of standard Young tableaux on a skew partition \(\lambda / \mu\), to make the aforementioned expressions explicit. We also calculate the limit probabilities of \(\mathbf{Prob}(P_\lambda; \alpha < \beta)\) when the elements \(\alpha,\beta\) are fixed cells, but the arm-lengths of \(\lambda=(\lambda_{1},\lambda_{2})\) tend to infinity with bounded difference \(\lambda_{1} - \lambda_{2}\).

math.CO

Some comments on "On the generating function for intervals in Young's lattice" by Azam and Richmond

Azam and Richmond arXiv:2107.09149 obtained a recursion for the generating function of \(P_\lambda(y)\), itself a generating function enumerating by length partitions in the lower ideal \([0,\lambda]\) in the Young lattice. We show that this recursion can be extended to a multi-graded version. This is done by interpreting the original problem as enumerating plane partitions with two rows. We can then use the well-developed theory of lattice points in polyhedral cones to determine some properties of the generating function. We also relate Azam and Richmond's result to those obtained by Andrews and Paule using MacMahons Omega-operator.

math.CO

Digraphs with a fixed number of edges and vertices, having a maximal number of walks of length 2

Inspired by the work of Backelin on non-commutative correspondences to Macaulay's theorem of the growth of the Hilbert series of affine algebras, we study embedding dimension dependant versions of his degree 2 to degree 3 result. In graph-theoretical terms, we study the following question: what is the maximal number of directed walks of length 2 in a digraph with (k) edges and (n) vertices? The problem can also be formulated as follows: maximize (< λ, λ^T >) when (λ) is a partition of (k), contained in an (n \times n) box. We show that for mild restrictions on (n), optimal digraphs are the ``stars of saturated stars''.

math.CO

Generating functions for borders

We give the generating function for the index of integer lattice points, relative to a finite order ideal. The index is an important concept in the theory of border bases, an alternative to Gr\"obner bases. Equivalently, we explicitly solve a class of difference equations where the right-hand side is the minimum of a number of affine forms.

math.CO

On the number of plane partitions and non isomorphic subgroup towers of abelian groups

We study the number of $k \times r$ plane partitions, weighted on the sum of the first row. Using Erhart reciprocity, we prove an identity for the generating function. For the special case $k=1$ this result follows from the classical theory of partitions, and for $k=2$ it was proved in Andersson-Bhowmik with another method. We give an explicit formula in terms of Young tableaux, and study the corresponding zeta-function. We give an application on the average orders of towers of abelian groups. In particular we prove that the number of isomorphism classes of ``subgroups of subgroups of ... ($k-1$ times) ... of abelian groups'' of order at most $N$ is asymptotic to $c_k N (\log N)^{k-1}$. This generalises results from Erd{\H o}s-Szekeres and Andersson-Bhowmik where the corresponding result was proved for $k=1$ and $k=2$.

math.NT

Infinite Minkowski sums of lattice polyhedra

Artinian integrally closed monomial ideals are characterized by their Newton polyhedra, which are lattice polyhedra inside the positive orthant having the positive orthant as their recession cone. Multiplication of such ideals correspond to Minkowski addition of their Newton polyhedra. In two dimensions, the isomorphic monoids of artinian, integrally closed monomial ideals under multiplication, or the class of lattice polyhedra described above, under Minkowski addition, are free abelian, as proved by Crispin-Quinonez. Bayer and Stillman considered so-called /monomial submodules/ of the Laurent polynomial ring. Inspired by this, we consider a family of such monomial submodules that can be (uniquely) expressed as an infinite product of monomial submodules isomorphic to integrally closed monomial ideals. Geometrically, their Newton polyhedras are expressed as an infinite Minkowski sum of *simple* lattice polyhedra. This gives another example of a *topological ufd* i.e. a topological abelian monoid in which every element can be uniquely written as a convergent (possibly infinite) product of irreducibles.

math.AC

Saturated chains in composition posets

We study three different poset structures on the set of all compositions. In the first case, the covering relation consists of inserting a part of size one to the left or to the right, or increasing the size of some part by one. The resulting poset was studied by the author in "A poset classifying non-commutative term orders", and then in "Standard paths in another composition poset" where some results about generating functions for standard paths in this poset was established. The latter article was inspired by the work of Bergeron, Bousquet-M{é}lou and Dulucq on "Standard paths in the composition poset", where they studied a poset where there are additional cover relations which allows the insertion of a part of size one anywhere in the composition. Finally, following a suggestion by Richard Stanley we study yet a third which is an extension of the previous two posets. This poset is related to quasi-symmetric functions. For these posets, we study generating functions for saturated chains of fixed width k. We also construct ``labeled'' non-commutative generating functions and their associated languages.

math.CO

Enumeration of concave integer partitions

An integer partition λof n corresponds, via its Ferrers diagram, to an artinian monomial ideal I of colength n in the polynomial ring on two variables. If the partition λcorresponds to an integrally closed ideal we call λconcave. We study generating functions for the number of concave partitions, unrestricted or with at most r parts.

math.CO

Standard paths in another composition poset

Bergeron, Bousquet-Melou and Dulucq enumerated paths in the Hasse diagram of the following poset: the underlying set is that of all compositions, and a composition μcovers another composition λif μcan be obtained from λby adding 1 to one of the parts of λ, or by inserting a part of size 1 into λ. We employ the methods they developed in order to study the same problem for the following poset: the underlying set is the same, but μcovers λif μcan be obtained from λby adding 1 to one of the parts of λ, or by inserting a part of size 1 at the left or at the right of λ. This poset is of interest because of its relation to non-commutative term orders.

math.CO

The maximal spectral radius of a digraph with (m+1)^2 - s edges

It is known that the spectral radius of a digraph with k edges is \le \sqrt{k}, and that this inequality is strict except when k is a perfect square. For k=m^2 + \ell, \ell fixed, m large, Friedland showed that the optimal digraph is obtained from the complete digraph on m vertices by adding one extra vertex, and a corresponding loop, and then connecting it to the first \lfloor \ell/2\rfloor vertices by pairs of directed edges (this is for odd \ell, for even \ell we add one extra edge to the new vertex). Using a combinatorial reciprocity theorem by Gessel, and a classification by Backelin on the digraphs on s edges having a maximal number of walks of length two, we obtain the following result: for fixed 0< s \neq 4, k=(m+1)^2 - s, m large, the maximal spectral radius of a digraph with k edges is obtained by the digraph which is constructed from the complete digraph on m+1 vertices by removing the loop at the last vertex together with \lfloor s/2 \rfloor pairs of directed edges that connect to the last vertex (if s is even, remove an extra edge connecting to the last vertex).

math.CO

Simplicial complexes associated to certain subsets of natural numbers and its applications to multiplicative functions

We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial complex with the property that the value on a face is the product of the values at the vertices of that face. We use this observation to solve the following problems: 1) Let r be a positive integer and c a real number. What is the maximum value that \sum_{s \in S}g(s) can obtain when S is a unitary ideal containing precisely r prime powers, and g is the multiplicative function determined by g(s)=c when s \in S is a prime power? 2) Suppose that g is a multiplicative function which is \ge 1, and that we want to find the maximum of g(i) when 1 \le i \le n. At how many integers do we need to evaluate g?

math.CO