Related papers: Combinatorial and number-theoretic properties of g…
We introduce the ramified partition algebra, which is a physically motivated and natural generalization of the partition algebra. We investigate its representation theory and demonstrate quasi--heredity under certain conditions. Under these…
We give upper bound for several highness properties in computability randomness theory. First, we prove that discrete covering property does not imply the ability to compute a 1-random real, answering a question of Greenberg, Miller and…
The main results of this paper (a) extend the finite Ramsey partition theorem, and (b) employ this extension to obtain a stronger form of the infinite Nash-Williams partition theorem, and also a new proof of Ellentuck's, and hence…
In the probability theory \emph{selfdecomposable, or class $L_0$ distributions} play an important role as they are limiting distributions of normalized partial sums of sequences of independent, not necessarily identically distributed,…
We study a bijective map from integer partitions to the prime factorizations of integers that we call the "supernorm" of a partition, in which the multiplicities of the parts of partitions are mapped to the multiplicities of prime factors…
The concepts of mean (i.e., average) and covariance of a random variable are fundamental in statistics, and are used to solve real-world problems such as those that arise in robotics, computer vision, and medical imaging. On matrix Lie…
The goal of this paper is to study when uniform Roe algebras have certain $C^*$-algebraic properties in terms of the underlying space: in particular, we study properties like having stable rank one or real rank zero that are thought of as…
Let $p_n$ be the number of partitions of an integer $n$. For each of the partition statistics of counting their parts, ranks, or cranks, there is a natural family of integer polynomials. We investigate their asymptotics and the limiting…
Many important problems in combinatorics and other related areas can be phrased in the language of independent sets in hypergraphs. Recently Balogh, Morris and Samotij, and independently Saxton and Thomason developed very general container…
Liouville numbers were the first class of real numbers which were proven to be transcendental. It is easy to construct non-normal Liouville numbers. Kano and Bugeaud have proved, using analytic techniques, that there are normal Liouville…
A resolution-free definition of rational singularities is introduced, and it is proved that for a variety admitting a resolution of singularities, so in particular in characteristic zero, this is equivalent to the usual definition. It is…
The set of the first Hilbert coefficients of parameter ideals relative to a module--its Chern coefficients--over a local Noetherian ring codes for considerable information about its structure--noteworthy properties such as that of…
We attempt to bring some modest unity to three subareas of heavy tail analysis and extreme value theory: limit laws for componentwise maxima of iid random variables;hidden regular variation and asymptotic independence;conditioned limit laws…
While the natural model-theoretic ranks available in differentially closed fields (of characteristic zero), namely Lascar and Morley rank, are known not to be definable in families of differential varieties; in this note we show that the…
For every natural number $m$, the existentially closed models of the theory of fields with $m$ commuting derivations can be given a first-order geometric characterization in several ways. In particular, the theory of these differential…
We study the asymptotics of representations of a fixed compact Lie group. We prove that the limit behavior of a sequence of such representations can be described in terms of certain random matrices; in particular operations on…
We consider the distribution of the major index on standard tableaux of arbitrary straight shape and certain skew shapes. We use cumulants to classify all possible limit laws for any sequence of such shapes in terms of a simple auxiliary…
Cohen-Lenstra heuristics for Jacobians of random graphs give rise to random partitions. We connect these random partitions to the Hall-Littlewood polynomials of symmetric function theory, and use this connection to give combinatorial proofs…
We apply the method of determinants to study the distribution of the largest singular values of large $ m \times n $ real rectangular random matrices with independent Cauchy entries. We show that statistical properties of the (rescaled by a…
We introduce the definability strength of combinatorial principles. In terms of definability strength, a combinatorial principle is strong if solving a corresponding combinatorial problem could help in simplifying the definition of a…