Searcharxiv⌕ Search

arXiv subjects

Mark C. Wilson

Publications and source records attributed to Mark C. Wilson.

32 records · Page 2Linked to original sources
arXiv2012

Asymptotics of coefficients of multivariate generating functions: improvements for multiple points

Let $F(x)= \sum_{ν\in\NN^d} F_νx^ν$ be a multivariate power series with complex coefficients that converges in a neighborhood of the origin. Assume $F=G/H$ for some functions $G$ and $H$ holomorphic in a neighborhood of the origin. We derive asymptotics for the coefficients $F_{rα}$ as $r \to \infty$ with $rα\in \NN^d$ for $α$ in a permissible subset of $d$-tuples of positive reals. More specifically, we give an algorithm for computing arbitrary terms of the asymptotic expansion for $F_{rα}$ when the asymptotics are controlled by a transverse multiple point of the analytic variety $H = 0$. This improves upon earlier work by R. Pemantle and M. C. Wilson. We have implemented our algorithm in Sage and apply it to obtain accurate numerical results for several rational combinatorial generating functions.

math.CO↗
arXiv2012

Probability calculations under the IAC hypothesis

We show how powerful algorithms recently developed for counting lattice points and computing volumes of convex polyhedra can be used to compute probabilities of a wide variety of events of interest in social choice theory. Several illustrative examples are given.

math.CO↗
arXiv2012

Asymptotics of coefficients of multivariate generating functions: improvements for smooth points

Let $\sum_{β\in\nats^d} F_βx^β$ be a multivariate power series. For example $\sum F_βx^β$ could be a generating function for a combinatorial class. Assume that in a neighbourhood of the origin this series represents a nonentire function $F=G/H^p$ where $G$ and $H$ are holomorphic and $p$ is a positive integer. Given a direction $α\in\pnats^d$ for which the asymptotics are controlled by a smooth point of the singular variety $H = 0$, we compute the asymptotics of $F_{n α}$ as $n\to\infty$. We do this via multivariate singularity analysis and give an explicit formula for the full asymptotic expansion. This improves on earlier work of R. Pemantle and the second author and allows for more accurate numerical approximation, as demonstrated by our examples.

math.CO↗
arXiv2010

An interesting new Mahonian permutation statistic

The standard algorithm for generating a random permutation gives rise to an obvious permutation statistic $\stat$ that is readily seen to be Mahonian. We give evidence showing that it is not equal to any previously published statistic. Nor does its joint distribution with the standard Eulerian statistics $\des$ and $\exc$ appear to coincide with any known Euler-Mahonian pair. A general construction of Skandera yields an Eulerian partner $\ska$ such that $(\ska, \stat)$ is equidistributed with $(\des, \maj)$. However $\ska$ itself appears not to be a known Eulerian statistic. Several ideas for further research on this topic are listed.

math.CO↗
arXiv2007

The diameter of random Cayley digraphs of given degree

We consider random Cayley digraphs of order $n$ with uniformly distributed generating set of size $k$. Specifically, we are interested in the asymptotics of the probability such a Cayley digraph has diameter two as $n\to\infty$ and $k=f(n)$. We find a sharp phase transition from 0 to 1 at around $k = \sqrt{n \log n}$. In particular, if $f(n)$ is asymptotically linear in $n$, the probability converges exponentially fast to 1.

math.CO↗
arXiv2007

Asymptotics of the minimum manipulating coalition size for positional voting rules under IC behaviour

We consider the problem of manipulation of elections using positional voting rules under Impartial Culture voter behaviour. We consider both the logical possibility of coalitional manipulation, and the number of voters that must be recruited to form a manipulating coalition. It is shown that the manipulation problem may be well approximated by a very simple linear program in two variables. This permits a comparative analysis of the asymptotic (large-population) manipulability of the various rules. It is seen that the manipulation resistance of positional rules with 5 or 6 (or more) candidates is quite different from the more commonly analyzed 3- and 4-candidate cases.

math.PR↗
arXiv2007

Random and exhaustive generation of permutations and cycles

In 1986 S. Sattolo introduced a simple algorithm for uniform random generation of cyclic permutations on a fixed number of symbols. This algorithm is very similar to the standard method for generating a random permutation, but is less well known. We consider both methods in a unified way, and discuss their relation with exhaustive generation methods. We analyse several random variables associated with the algorithms and find their grand probability generating functions, which gives easy access to moments and limit laws.

math.CO↗
arXiv2007

Twenty combinatorial examples of asymptotics derived from multivariate generating functions

Let $\{a_\rr : \rr \in (\Z^+)^d \}$ be a $d$-dimensional array of numbers, for which the generating function $F(\zz) := \sum_\rr a_\rr \zz^\rr$ is meromorphic in a neighborhood of the origin. For example, $F$ may be a rational multivariate generating function. We discuss recent results that allow the effective computation of asymptotic expansions for the coefficients of $F$. Our purpose is to illustrate the use of these techniques on a variety of problems of combinatorial interest. The survey begins by summarizing previous work on the asymptotics of univariate and multivariate generating functions. Next we describe the Morse-theoretic underpinnings of some new asymptotic techniques. We then quote and summarize these results in such a way that only elementary analyses are needed to check hypotheses and carry out computations. The remainder of the survey focuses on combinatorial applications, such as enumeration of words with forbidden substrings, edges and cycles in graphs, polyominoes, and descents in permutations. After the individual examples, we discuss three broad classes of examples, namely functions derived via the transfer matrix method, those derived via the kernel method, and those derived via the method of Lagrange inversion. These methods have the property that generating functions derived from them are amenable to our asymptotic analyses, and we describe further machinery that facilitates computations for these classes of examples.

math.CO↗
arXiv1998

Primitive ideals in Hopf algebra extensions

Let $H$ be a finite-dimensional Hopf algebra. We study the behaviou r of primitive and maximal ideals in certain types of ring extensions determined by $H$. The main focus is on the class of faithfully flat Galois extensions, which includes includes smash and crossed products. It is shown how analogous results can be obtained for the larger class of extensions possessing a total integral, which includes extensions $A^H\subseteq A $ when $H$ is semisimple. We use Passman's "primitivity machine" to reduce the whole theory of Kr ull relations for prime ideals to the case of primitive ideals. The concept of strongly semiprimitive Hopf algebra is introduced and investigated. Several examples and open problems are discussed.

math.RA↗
arXiv1998

X-inner automorphisms of semi-commutative quantum algebras

Many important quantum algebras such as quantum symplectic space, quantum Euclidean space, quantum matrices, $q$-analogs of the Heisenberg algebra and the quantum Weyl algebra are semi-commutative. In addition, enveloping algebras $U(L_+)$ of even Lie color algebras are also semi-commutative. In this paper, we generalize work of Montgomery and examine the $X$-inner automorphisms of such algebras. The theorems and examples in our paper show that for algebras $R$ of this type, the non-identity $X$-inner automorphisms of $R$ tend to have infinite order. Thus if $G$ is a finite group of automorphisms of $R$, then the action of $G$ will be $X$-outer and this immediately gives useful information about crossed products $R*_tG$.

math.RA↗
arXiv1998

Group algebras and enveloping algebras with nonmatrix and semigroup identities

Let K be a field of positive characteristic p, let R be either a group algebra K[G] or a restricted enveloping algebra u(L), and let I be the augmentation ideal of R. We first characterize those R for which I satisfies a polynomial identity not satisfied by the algebra of all 2-by-2 matrices over K. Then we examine those R for which I satisfies a semigroup identity (that is, a polynomial identity which can be written as the difference of two monomials).

math.RT↗
arXiv1998

Associative algebras satisfying a semigroup identity

Denote by (R,.) the multiplicative semigroup of an associative algebra R over an infinite field, and let (R,*) represent R when viewed as a semigroup via the circle operation x*y=x+y+xy. In this paper we characterize the existence of an identity in these semigroups in terms of the Lie structure of R. Namely, we prove that the following conditions on R are equivalent: the semigroup (R,*) satisfies an identity; the semigroup (R,.) satisfies a reduced identity; and, the associated Lie algebra of R satisfies the Engel condition. When R is finitely generated these conditions are each equivalent to R being upper Lie nilpotent.

math.RA↗