Related papers: Majorization and Spherical Functions
We survey structures endowed with natural partial orderings and prove their universality. These partial orders include partial orders on sets of words, partial orders formed by geometric objects, grammars, polynomials and homomorphism order…
For a generic value of the central charge, we prove the holomorphic factorization of partition functions for free superconformal fields which are defined on a compact Riemann surface without boundary. The partition functions are viewed as…
Symplectic eigenvalues are known to satisfy analogs of several classic eigenvalue inequalities. Of these is a set of weak supermajorization relations concerning symplectic eigenvalues that are weaker analogs of some majorization relations…
The method of \emph{random integral representation}, that is, the method of representing a given probability measure as the probability distribution of some random integral, was quite successful in the past few decades. In this note we will…
In [arXiv 0811.3913] the authors introduced the notion of quasi-polynomial function as being a mapping f: X^n -> X defined and valued on a bounded chain X and which can be factorized as f(x_1,...,x_n)=p(phi(x_1),...,phi(x_n)), where p is a…
The vector space of all polynomial functions of degree $k$ on a box of dimension $n$ is of dimension ${n \choose k}$. A consequence of this fact is that a function can be approximated on vertices of the box using other vertices to higher…
Solution of some boundary value problems and initial problems in unique ball leads to the convergence and sumability problems of Fourier series of given function by eigenfunctions of Laplace operator on a sphere - spherical harmonics. Such…
For $0<q<1$, let $Maj$ be the distribution on the symmetric group $S_n$ such that a permutation $\pi \in S_n$ is selected with probability proportional to $q^{maj(\pi)}$. The distribution has connections to $q$-Plancherel measure. We…
If a (weighted) spherical design is defined as an integration (cubature) rule for a unitarily invariant space P of polynomials (on the sphere), then any unitary image of it is also such a spherical design. It therefore follows that such…
Integer factorization is a fundamental problem in algorithmic number theory and computer science. It is considered as a one way or trapdoor function in the (RSA) cryptosystem. To date, from elementary trial division to sophisticated methods…
For $f$ a Steinhaus random multiplicative function, we prove convergence in distribution of the appropriately normalised partial sums \[ \frac{{(\log \log x)}^{1/4}}{\sqrt{x}} \sum_{\substack{n \leq x \\ P(n) > \sqrt{x}}} f(n), \] where…
In this chapter a general mathematical framework for probabilistic theories of operationally understood circuits is laid out. Circuits are comprised of operations and wires. An operation is one use of an apparatus and a wire is a…
We consider the problem of computing matrix polynomials $p(X)$, where $X$ is a large dense matrix, with as few matrix-matrix multiplications as possible. More precisely, let $\Pi_{2^{m}}^*$ represent the set of polynomials computable with…
Let $R$ be an order in an algebraic number field. If $R$ is a principal order, then many explicit results on its arithmetic are available. Among others, $R$ is half-factorial if and only if the class group of $R$ has at most two elements.…
If K/k is a function field in one variable of positive characteristic, we describe a general algorithm to factor one-variable polynomials with coefficients in K. The algorithm is flexible enough to find factors subject to additional…
Low-rank matrix factorizations are a class of linear models widely used in various fields such as machine learning, signal processing, and data analysis. These models approximate a matrix as the product of two smaller matrices, where the…
Randomization is a fundamental tool used in many theoretical and practical areas of computer science. We study here the role of randomization in the area of submodular function maximization. In this area most algorithms are randomized, and…
We study the problem of assigning indivisible objects to agents where each is to receive at most one. To ensure fairness in the absence of monetary compensation, we consider random assignments. Random Priority, also known as Random Serial…
Spinor polynomials are polynomials with coefficients in the even sub-algebra of conformal geometric algebra whose norm polynomial is real. They describe rational conformal motions. Factorizations of spinor polynomial corresponds to the…
We clarified the connection between measurements and partitions, and discussed the meaning of semiotics for measurements based on functions. The terms of property and relation quantity were defined by our understanding of partitions and…