SearcharxivSearch

arXiv subjects

Keith Ball

Publications and source records attributed to Keith Ball.

12 recordsLinked to original sources

Approximate isoperimetry for convex polytopes

For all $n,\phi\in \mathbb{N}$ with $\phi\geqslant n+1$, the smallest possible isoperimetric quotient of an $n$-dimensional convex polytope that has $\phi$ facets is shown to be bounded from above and from below by positive universal constant multiples of $\max\big\{n/\sqrt{1+\log (\phi/n)},\sqrt{n}\big\}$. For all $n\in \mathbb{N}$ and $2n\leqslant \beta\in 2\mathbb{N}$, it is shown that every $n$-dimensional origin-symmetric convex polytope that has $\beta$ vertices admits an affine image whose isoperimetric quotient is at most a universal constant multiple of $\min\big\{\sqrt{\log(\beta/n)},n\big\}$, which is sharp. The weak isomorphic reverse isoperimetry conjecture is proved for $n$-dimensional convex polytopes that have $O(n)$ facets by demonstrating that any such polytope $K$ has an image $K'$ under a volume preserving matrix and a convex body $L\subseteq K'$ such that the isoperimetric quotient of $L$ is at most a universal constant multiple of $\sqrt{n}$, and also $\sqrt[n]{\mathrm{vol}_n(L)/\mathrm{vol}_n(K)}$ is at least a positive universal constant.

math.MG

Large-Scale AI in Telecom: Charting the Roadmap for Innovation, Scalability, and Enhanced Digital Experiences

This white paper discusses the role of large-scale AI in the telecommunications industry, with a specific focus on the potential of generative AI to revolutionize network functions and user experiences, especially in the context of 6G systems. It highlights the development and deployment of Large Telecom Models (LTMs), which are tailored AI models designed to address the complex challenges faced by modern telecom networks. The paper covers a wide range of topics, from the architecture and deployment strategies of LTMs to their applications in network management, resource allocation, and optimization. It also explores the regulatory, ethical, and standardization considerations for LTMs, offering insights into their future integration into telecom infrastructure. The goal is to provide a comprehensive roadmap for the adoption of LTMs to enhance scalability, performance, and user-centric innovation in telecom networks.

cs.NI

Rational approximations to the zeta function

This article describes a sequence of rational functions which converges locally uniformly to the zeta function. The numerators (and denominators) of these rational functions can be expressed as characteristic polynomials of matrices that are on the face of it very simple. As a consequence, the Riemann hypothesis can be restated as what looks like a rather conventional spectral problem but which is related to the one found by Connes in his analysis of the zeta function. However the point here is that the rational approximations look to be susceptible of quantitative estimation.

math.NT

Wronskians and Linear Dependence of Formal Power Series

We give a new proof of the fact that the vanishing of generalized Wronskians implies linear dependence of formal power series in serveral variables. Our results are also valid for quotients of germs of analytic functions.

math.AC

Entropy jumps for isotropic log-concave random vectors and spectral gap

We prove a quantitative dimension-free bound in the Shannon-Stam Entropy inequality for the convolution of two log-concave distributions in dimension d interms of the spectral gap of the density. The method relies on the analysis of the Fisher Information production, which is the second derivative of the Entropy along the (normalized) Heat semi-group. We also discuss consequences of our result in the study of the isotropic constant of log-concave distributions (slicing problem).

math.FA

Ellipsoids of maximal volume in convex bodies

The largest discs contained in a regular tetrahedron lie in its faces. The proof is closely related to the theorem of Fritz John characterising ellipsoids of maximal volume contained in convex bodies.

math.MG

The plank problem for symmetric bodies

Given a symmetric convex body $C$ and $n$ hyperplanes in an Euclidean space, there is a translate of a multiple of $C$, at least ${1\over n+1}$ times as large, inside $C$, whose interior does not meet any of the hyperplanes. The result generalizes Bang's solution of the plank problem of Tarski and has applications to Diophantine approximation.

math.MG

Convex bodies with few faces

It is proved that if $u_1,\ldots, u_n$ are vectors in ${\Bbb R}^k, k\le n, 1 \le p < \infty$ and $$r = ({1\over k} \sum ^n_1 |u_i|^p)^{1\over p}$$ then the volume of the symmetric convex body whose boundary functionals are $\pm u_1,\ldots, \pm u_n$, is bounded from below as $$|\{ x\in {\Bbb R}^k\colon \ |\langle x,u_i\rangle | \le 1 \ \hbox{for every} \ i\}|^{1\over k} \ge {1\over \sqrt{\rho}r}.$$ An application to number theory is stated.

math.MG

Shadows of convex bodies

It is proved that if $C$ is a convex body in ${\Bbb R}^n$ then $C$ has an affine image $\widetilde C$ (of non-zero volume) so that if $P$ is any 1-codimensional orthogonal projection, $$|P\widetilde C| \ge |\widetilde C|^{n-1\over n}.$$ It is also shown that there is a pathological body, $K$, all of whose orthogonal projections have volume about $\sqrt{n}$ times as large as $|K|^{n-1\over n}$.

math.MG

Volume ratios and a reverse isoperimetric inequality

It is shown that if $C$ is an $n$-dimensional convex body then there is an affine image $\widetilde C$ of $C$ for which $${|\partial \widetilde C|\over |\widetilde C|^{n-1\over n}}$$ is no larger than the corresponding expression for a regular $n$-dimensional ``tetrahedron''. It is also shown that among $n$-dimensional subspaces of $L_p$ (for each $p\in [1,\infty]), \ell^n_p$ has maximal volume ratio.\vskip3in

math.MG