Related papers: $L_p$ regular sparse hypergraphs: box norms

We improve and expand in two directions the theory of norms on complex matrices induced by random vectors. We first provide a simple proof of the classification of weakly unitarily invariant norms on the Hermitian matrices. We use this to…

We prove some noncommutative analogues of a theorem by Plotkin and Rudin about isometries between subspaces of Lp-spaces. Let 0<p<\infty, p not an even integer. The main result of this paper states that in the category of unital subspaces…

As a natural generalization of line graphs, Hoffman line graphs were defined by Woo and Neumaier. Especially, Hoffman line graphs are closely related to the smallest eigenvalue of graphs, and the uniqueness of strict covers of a Hoffman…

Employing the currently discussed notion of pseudo-Hermiticity, we define a pseudo-unitary group. Further, we develop a random matrix theory which is invariant under such a group and call this ensemble of pseudo-Hermitian random matrices as…

We show that the continuous $L^p$-cohomology of locally compact second countable groups is a quasi-isometric invariant. As an application, we prove partial results supporting a positive answer to a question asked by M.~Gromov, suggesting a…

In this note, we consider the width of a supercritical random graph according to some commonly studied width measures. We give short, direct proofs of results of Lee, Lee and Oum, and of Perarnau and Serra, on the rank- and tree-width of…

We investigate the norm of sums of independent vector-valued random variables in noncommutative Lp spaces. This allows us to obtain a uniform family of complete embeddings of the Schatten class Sq^n in Sp(lq^m) with optimal order m = n^2.…

We generalize ultraproducts and local-global limits of graphs to hypergraphs and other structures. We show that the local statistics of an ultraproduct of a sequence of hypergraphs are the ultralimits of the local statistics of the…

The notion of the Haagerup approximation property, originally introduced for von Neumann algebras equipped with a faithful normal tracial state, is generalized to arbitrary von Neumann algebras. We discuss two equivalent characterisations,…

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…

We define a family {$\gamma(P)$} of generalized Euler constants indexed by finite sets of primes $P$ and study their distribution. These arise from partial sums of reciprocals of integers not divisible by any prime in $P$. An apparent…

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

This is a brief review of our recent work attempted at a generalization of the Grassmann algebra to the paragrassmann ones. The main aim is constructing an algebraic basis for representing `fractional' symmetries appearing in $2D$…

We study a generalization of free Poisson random measure by replacing the intensity measure with a n.s.f. weight $\varphi$ on a von Neumann algebra $M$. We give an explicit construction of the free Poisson random weight using full Fock…

While Szemer\'edi's graph regularity lemma is an indispensable tool for studying extremal problems in graph theory, using it comes with a hefty price, since a worst-case graph may only have regular partitions of tower-type size. It is thus…

Extending a previous result of the first two authors, we prove a local limit theorem for the joint distribution of subgraph counts in the Erd\H{o}s-R\'{e}nyi random graph $G(n,p)$. This limit can be described as a nonlinear transformation…

Possible irreducible holonomy algebras $\g\subset\osp(p,q|2m)$ of Riemannian supermanifolds under the assumption that $\g$ is a direct sum of simple Lie superalgebras of classical type and possibly of a one-dimensional center are…

The hypergraph regularity lemma -- the extension of Szemer\'edi's graph regularity lemma to the setting of $k$-uniform hypergraphs -- is one of the most celebrated combinatorial results obtained in the past decade. By now there are several…

In 2002, D. Fon-Der-Flaass constructed a prolific family of strongly regular graphs. In this paper, we prove that for infinitely many natural numbers $n$, this family contains $n^{\Omega(n^{2/3})}$ strongly regular $n$-vertex graphs $X$…

We prove several new results on the Hamming weight of bounded uniform and small-bias distributions. We exhibit bounded-uniform distributions whose weight is anti-concentrated, matching existing concentration inequalities. This construction…