Related papers: Unitary Space Time Constellation Analysis: An Uppe…
The large-scale statistics of observables such as the galaxy density are chiefly determined by their dependence on the local coarse-grained matter density. This dependence can be measured directly and efficiently in N-body simulations by…
A class of $(2n)^2\times(2n)^2$ multiparameter braid matrices are presented for all $n$ $(n\geq 1)$. Apart from the spectral parameter $\theta$, they depend on $2n^2$ free parameters $m_{ij}^{(\pm)}$, $i,j=1,...,n$. For real parameters the…
We analyze the general problem of determining optimally dense packings, in a Euclidean or hyperbolic space, of congruent copies of some fixed finite set of bodies. We are strongly guided by examples of aperiodic tilings in Euclidean space…
We establish uniform bounds on the multiplicities of irreducible admissible representations appearing in spaces of functions on symmetric spaces over $p$-adic fields. These multiplicities can exceed one and depend intricately on the group,…
Every spacetime is defined by its metric, the mathematical object which further defines the spacetime curvature. From the relativity principle, we have the freedom to choose which coordinate system to write our metric in. Some coordinate…
Composed ensembles of random unitary matrices are defined via products of matrices, each pertaining to a given canonical circular ensemble of Dyson. We investigate statistical properties of spectra of some composed ensembles and demonstrate…
We obtain a new upper bound for binary sums with multiplicative characters over variables belong to some sets, having small additive doubling.
Global physical properties of random media change qualitatively at a percolation threshold, where isolated clusters merge to form one infinite connected component. The precise knowledge of percolation thresholds is thus of paramount…
We prove upper bounds on the average kissing number $k(\mathcal{P})$ and contact number $C(\mathcal{P})$ of an arbitrary finite non-congruent sphere packing $\mathcal{P}$, and prove an upper bound on the packing density…
It is well known that a spherically symmetric compact star whose energy density decreases monotonically possesses an upper bound on its mass-to-radius ratio, $2M/R\leq 8/9$. However, field configurations typically will not be compact. Here…
Substellar multiplicity is a key outcome of the formation process. The biggest challenge for the next decade will be to distinguish between the formation history, environmental conditions, and dynamical evolution leading to the least…
Given a large set $U$ where each item $a\in U$ has weight $w(a)$, we want to estimate the total weight $W=\sum_{a\in U} w(a)$ to within factor of $1\pm\varepsilon$ with some constant probability $>1/2$. Since $n=|U|$ is large, we want to do…
We study $\epsilon$-representations of discrete groups by unitary operators on a Hilbert space. We define the notion of Ulam stability of a group which loosely means that finite-dimensional $\epsilon$-represendations are uniformly close to…
We study the notion of positive and negative complexity of pairs of objects in cluster categories. The first main result shows that the maximal complexity occurring is either one, two or infinite, depending on the representation type of the…
The discovery around the turn of the millenium of a population of very massive (M$_\star$ > 2$\times$10$^6$ M$_\odot$) compact stellar systems (CSS) with physical properties (radius, velocity dispersion, stellar mass etc.) that are…
Most stars do not form in isolation but as part of a cluster comprising anywhere between a few dozen to several million stars with stellar densities ranging from 0.01 to several 10$^5$ \Msun pc$^{-3}$. The majority of these clusters…
The Bin Packing Problem involves efficiently packing items into a limited number of bins without exceeding their capacity. In this paper, we try to answer a specific question in this field. Mathematically the combinatorial optimization…
Maximum diversity aims at selecting a diverse set of high-quality objects from a collection, which is a fundamental problem and has a wide range of applications, e.g., in Web search. Diversity under a uniform or partition matroid constraint…
Let $D$ and $E$ be subspaces of the tensor product of the finite-dimensional Hilbert spaces $\mathbb{C}^m \otimes \mathbb{C}^n$. We show that the number of product vectors in $D$ with their partial conjugates in $E$ is uniformly bounded…
We revisit the problem of high-dimensional multiple packing in Euclidean space. Multiple packing is a natural generalization of sphere packing and is defined as follows. Let $ N>0 $ and $ L\in\mathbb{Z}_{\ge2} $. A multiple packing is a set…