To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure no-reply@cambridge.org
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
We study the problem of determining, for a polynomial function $f$ on a vector space $V$, the linear transformations $g$ of $V$ such that $f\circ g=f$. When $f$ is invariant under a simple algebraic group $G$ acting irreducibly on $V$, we note that the subgroup of $\text{GL}(V)$ stabilizing $f$ often has identity component $G$, and we give applications realizing various groups, including the largest exceptional group $E_{8}$, as automorphism groups of polynomials and algebras. We show that, starting with a simple group $G$ and an irreducible representation $V$, one can almost always find an $f$ whose stabilizer has identity component $G$, and that no such $f$ exists in the short list of excluded cases. This relies on our core technical result, the enumeration of inclusions $G<H\leqslant \text{SL}(V)$ such that $V/H$ has the same dimension as $V/G$. The main results of this paper are new even in the special case where $k$ is the complex numbers.
We study systems of $n$ points in the Euclidean space of dimension $d\geqslant 1$ interacting via a Riesz kernel $|x|^{-s}$ and confined by an external potential, in the regime where $d-2\leqslant s<d$. We also treat the case of logarithmic interactions in dimensions 1 and 2. Our study includes and retrieves all cases previously studied in Sandier and Serfaty [2D Coulomb gases and the renormalized energy, Ann. Probab. (to appear); 1D log gases and the renormalized energy: crystallization at vanishing temperature (2013)] and Rougerie and Serfaty [Higher dimensional Coulomb gases and renormalized energy functionals, Comm. Pure Appl. Math. (to appear)]. Our approach is based on the Caffarelli–Silvestre extension formula, which allows one to view the Riesz kernel as the kernel of an (inhomogeneous) local operator in the extended space $\mathbb{R}^{d+1}$.
As $n\rightarrow \infty$, we exhibit a next to leading order term in $n^{1+s/d}$ in the asymptotic expansion of the total energy of the system, where the constant term in factor of $n^{1+s/d}$ depends on the microscopic arrangement of the points and is expressed in terms of a ‘renormalized energy’. This new object is expected to penalize the disorder of an infinite set of points in whole space, and to be minimized by Bravais lattice (or crystalline) configurations. We give applications to the statistical mechanics in the case where temperature is added to the system, and identify an expected ‘crystallization regime’. We also obtain a result of separation of the points for minimizers of the energy.
In this paper we consider Grassmannians in arbitrary characteristic. Generalizing Kapranov’s well-known characteristic-zero results, we construct dual exceptional collections on them (which are, however, not strong) as well as a tilting bundle. We show that this tilting bundle has a quasi-hereditary endomorphism ring and we identify the standard, costandard, projective and simple modules of the latter.
We consider higher secant varieties to Veronese varieties. Most points on the rth secant variety are represented by a finite scheme of length r contained in the Veronese variety – in fact, for a general point, the scheme is just a union of r distinct points. A modern way to phrase it is: the smoothable rank is equal to the border rank for most polynomials. This property is very useful for studying secant varieties, especially, whenever the smoothable rank is equal to the border rank for all points of the secant variety in question. In this note, we investigate those special points for which the smoothable rank is not equal to the border rank. In particular, we show an explicit example of a cubic in five variables with border rank 5 and smoothable rank 6. We also prove that all cubics in at most four variables have the smoothable rank equal to the border rank.
A basis ${\mathcal{B}}=\{u_{i}\}_{i\in I}$ of a commutative or anticommutative algebra $\mathfrak{C},$ over an arbitrary base field $\mathbb{F}$, is called multiplicative if for any $i,j\in I$ we have that $u_{i}u_{j}\in \mathbb{F}u_{k}$ for some $k\in I$. We show that if a commutative or anticommutative algebra $\mathfrak{C}$ admits a multiplicative basis then it decomposes as the direct sum $\mathfrak{C}=\bigoplus _{j}\mathfrak{i}_{j}$ of well-described ideals each one of which admits a multiplicative basis. Also the minimality of $\mathfrak{C}$ is characterised in terms of the multiplicative basis and it is shown that, under a mild condition, the above direct sum is indexed by the family of its minimal ideals admitting a multiplicative basis.
The class of almost completely decomposable groups with a critical typeset of type $(2,2)$ and a homocyclic regulator quotient of exponent $p^{3}$ is shown to be of bounded representation type. There are only $16$ isomorphism at $p$ types of indecomposables, all of rank $8$ or lower.
For a positive integer $n\geq 2$, let $M_{n}$ be the set of $n\times n$ complex matrices and $H_{n}$ the set of Hermitian matrices in $M_{n}$. We characterize injective linear maps ${\it\phi}:H_{m_{1}\cdots m_{l}}\rightarrow H_{n}$ satisfying
for all $A_{k}\in H_{m_{k}}$, $k=1,\dots ,l$, where $l,m_{1},\dots ,m_{l}\geq 2$ are positive integers. The necessity of the injectivity assumption is shown. Moreover, the connection of the problem to quantum information science is mentioned.
We study the properties of the multivariate skew normal distribution as an approximation to the distribution of the sum of n independent, identically distributed random vectors. More precisely, we establish conditions ensuring that the uniform distance between the two distribution functions converges to 0 at a rate of n-2/3. The advantage over the corresponding normal approximation is particularly relevant when the summands are skewed and n is small, as illustrated for the special case of exponentially distributed random variables. Applications to some well-known multivariate distributions are also discussed.
We propose a discrete state-space model for storage of urban stormwater in two connected dams using an optimal pump-to-fill policy to transfer water from the capture dam to the holding dam. We assume stochastic supply to the capture dam and independent stochastic demand from the holding dam. We find new analytic formulae to calculate steady-state probabilities for the contents of each dam and thereby enable operators to better understand system behaviour. We illustrate our methods by considering some particular examples and discuss extension of our analysis to a series of three connected dams.
When a discrete-time homogenous Markov chain is observed at time intervals that correspond to its time unit, then the transition probabilities of the chain can be estimated using known maximum likelihood estimators. In this paper we consider a situation when a Markov chain is observed on time intervals with length equal to twice the time unit of the Markov chain. The issue then arises of characterizing probability matrices whose square root(s) are also probability matrices. This characterization is referred to in the literature as the embedding problem for discrete time Markov chains. The probability matrix which has probability root(s) is called embeddable.
In this paper for two-state Markov chains, necessary and sufficient conditions for embeddability are formulated and the probability square roots of the transition matrix are presented in analytic form. In finding conditions for the existence of probability square roots for (k x k) transition matrices, properties of row-normalized matrices are examined. Besides the existence of probability square roots, the uniqueness of these solutions is discussed: In the case of nonuniqueness, a procedure is introduced to identify a transition matrix that takes into account the specificity of the concrete context. In the case of nonexistence of a probability root, the concept of an approximate probability root is introduced as a solution of an optimization problem related to approximate nonnegative matrix factorization.
The (real) Grothendieck constant ${K}_{G} $ is the infimum over those $K\in (0, \infty )$ such that for every $m, n\in \mathbb{N} $ and every $m\times n$ real matrix $({a}_{ij} )$ we have
The classical Grothendieck inequality asserts the nonobvious fact that the above inequality does hold true for some $K\in (0, \infty )$ that is independent of $m, n$ and $({a}_{ij} )$. Since Grothendieck’s 1953 discovery of this powerful theorem, it has found numerous applications in a variety of areas, but, despite attracting a lot of attention, the exact value of the Grothendieck constant ${K}_{G} $ remains a mystery. The last progress on this problem was in 1977, when Krivine proved that ${K}_{G} \leqslant \pi / 2\log (1+ \sqrt{2} )$ and conjectured that his bound is optimal. Krivine’s conjecture has been restated repeatedly since 1977, resulting in focusing the subsequent research on the search for examples of matrices $({a}_{ij} )$ which exhibit (asymptotically, as $m, n\rightarrow \infty $) a lower bound on ${K}_{G} $ that matches Krivine’s bound. Here, we obtain an improved Grothendieck inequality that holds for all matrices $({a}_{ij} )$ and yields a bound ${K}_{G} \lt \pi / 2\log (1+ \sqrt{2} )- {\varepsilon }_{0} $ for some effective constant ${\varepsilon }_{0} \gt 0$. Other than disproving Krivine’s conjecture, and along the way also disproving an intermediate conjecture of König that was made in 2000 as a step towards Krivine’s conjecture, our main contribution is conceptual: despite dealing with a binary rounding problem, random two-dimensional projections, when combined with a careful partition of ${ \mathbb{R} }^{2} $ in order to round the projected vectors to values in $\{ - 1, 1\} $, perform better than the ubiquitous random hyperplane technique. By establishing the usefulness of higher-dimensional rounding schemes, this fact has consequences in approximation algorithms. Specifically, it yields the best known polynomial-time approximation algorithm for the Frieze–Kannan Cut Norm problem, a generic and well-studied optimization problem with many applications.
Let ${ \mathbb{K} }^{m\times n} $ denote the set of all $m\times n$ matrices over a skew field $ \mathbb{K} $. In this paper, we give a necessary and sufficient condition for the existence of the group inverse of $P+ Q$ and its representation under the condition $PQ= 0$, where $P, Q\in { \mathbb{K} }^{n\times n} $. In addition, in view of the natural characters of block matrices, we give the existence and representation for the group inverse of $P+ Q$ and $P+ Q+ R$ under some conditions, where $P, Q, R\in { \mathbb{K} }^{n\times n} $.
Connections between annihilators and ideals in Frobenius and symmetric algebras are used to provide a new proof of a result of Nakayama on quotient algebras, and an application is given to central symmetric algebras.
We prove a normalized version of the restricted invertibility principle obtained by Spielman and Srivastava in [An elementary proof of the restricted invertibility theorem. Israel J. Math.190 (2012), 83–91]. Applying this result, we get a new proof of the proportional Dvoretzky–Rogers factorization theorem recovering the best current estimate in the symmetric setting while we improve the best known result in the non-symmetric case. As a consequence, we slightly improve the estimate for the Banach–Mazur distance to the cube: the distance of every $n$-dimensional normed space from ${ \ell }_{\infty }^{n} $ is at most $\mathop{(2n)}\nolimits ^{5/ 6} $. Finally, using tools from the work of Batson et al in [Twice-Ramanujan sparsifiers. In STOC’09 – Proceedings of the 2009 ACM International Symposium on Theory of Computing, ACM (New York, 2009), 255–262], we give a new proof for a theorem of Kashin and Tzafriri [Some remarks on the restriction of operators to coordinate subspaces. Preprint, 1993] on the norm of restricted matrices.
The critical paths of a max-plus linear system with noise are random variables. In this paper we introduce the edge criticalities which measure how often the critical paths traverse each edge in the precedence graph. We also present the parallel path approximation, a novel method for approximating these new statistics as well as the previously studied max-plus exponent. We show that, for low amplitude noise, the critical paths spend most of their time traversing the deterministic maximally weighted cycle and that, as the noise amplitude is increased, the critical paths become more random and their distribution over the edges in the precedence graph approaches a highly uniform measure of maximal entropy.
Ritt introduced the concepts of prime and composite polynomials and proved three fundamental theorems on factorizations (in the sense of compositions) of polynomials in 1922. In this paper, we shall give a density estimate on the set of composite polynomials.
The saturation theorem of Knutson and Tao concerns the nonvanishing of Littlewood–Richardson coefficients. In combination with work of Klyachko, it implies Horn’s conjecture about eigenvalues of sums of Hermitian matrices. This eigenvalue problem has a generalization to majorized sums of Hermitian matrices, due to S. Friedland. We further illustrate the common features between these two eigenvalue problems and their connection to Schubert calculus of Grassmannians. Our main result gives a Schubert calculus interpretation of Friedland’s problem, via equivariant cohomology of Grassmannians. In particular, we prove a saturation theorem for this setting. Our arguments employ the aforementioned work together with recent work of H. Thomas and A. Yong.
Let $A, B$ be two square complex matrices of the same dimension $n\leq 3$. We show that the following conditions are equivalent. (i) There exists a finite subset $U\subset { \mathbb{N} }_{\geq 2} $ such that for every $t\in \mathbb{N} \setminus U$, $\exp (tA+ B)= \exp (tA)\exp (B)= \exp (B)\exp (tA)$. (ii) The pair $(A, B)$ has property L of Motzkin and Taussky and $\exp (A+ B)= \exp (A)\exp (B)= \exp (B)\exp (A)$. We also characterise the pairs of real matrices $(A, B)$ of dimension three, that satisfy the previous conditions.
We prove that a continuous map $\phi $ defined on the set of all $n\times n$ Hermitian matrices preserving order in both directions is up to a translation a congruence transformation or a congruence transformation composed with the transposition.
Spot prices in energy markets exhibit special features, such as price spikes, mean reversion, stochastic volatility, inverse leverage effect, and dependencies between the commodities. In this paper a multivariate stochastic volatility model is introduced which captures these features. The second-order structure and stationarity of the model are analyzed in detail. A simulation method for Monte Carlo generation of price paths is introduced and a numerical example is presented.