Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userUniversal upper and lower bounds on energy of spherical designs
59
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
Linear programming (polynomial) techniques are used to obtain lower and upper bounds for the potential energy of spherical designs. This approach gives unified bounds that are valid for a large class of potential functions. Our lower bounds are optimal for absolutely monotone potentials in the sense that for the linear programming technique they cannot be improved by using polynomials of the same or lower degree. When additional information about the structure (upper and lower bounds for the inner products) of the designs is known, improvements on the bounds are obtained. Furthermore, we provide `test functions for determining when the linear programming lower bounds for energy can be improved utilizing higher degree polynomials. We also provide some asymptotic results for these energy bounds.
rate research
Read More
We derive and investigate lower bounds for the potential energy of finite spherical point sets (spherical codes). Our bounds are optimal in the following sense -- they cannot be improved by employing polynomials of the same or lower degrees in the Delsarte-Yudin method. However, improvements are sometimes possible and we provide a necessary and sufficient condition for the existence of such better bounds. All our bounds can be obtained in a unified manner that does not depend on the potential function, provided the potential is given by an absolutely monotone function of the inner product between pairs of points, and this is the reason for us to call them universal. We also establish a criterion for a given code of dimension $n$ and cardinality $N$ not to be LP-universally optimal, e.g. we show that two codes conjectured by Ballinger et al to be universally optimal are not LP-universally optimal.
Thermal energy can be conducted by different mechanisms including by single particles or collective excitations. Thermal conductivity is system-specific and shows a richness of behaviors currently explored in different systems including insulators, strange metals and cuprate superconductors. Here, we show that despite the seeming complexity of thermal transport, the thermal diffusivity $alpha$ of liquids and supercritical fluids has a lower bound which is fixed by fundamental physical constants for each system as $alpha_m=frac{1}{4pi}frac{hbar}{sqrt{m_em}}$, where $m_e$ and $m$ are electron and molecule masses. The newly introduced elementary thermal diffusivity has an absolute lower bound dependent on $hbar$ and the proton-to-electron mass ratio only. We back up this result by a wide range of experimental data. We also show that theoretical minima of $alpha$ coincide with the fundamental lower limit of kinematic viscosity $ u_m$. Consistent with experiments, this points to a universal lower bound for two distinct properties, energy and momentum diffusion, and a surprising correlation between the two transport mechanisms at their minima. We observe that $alpha_m$ gives the minimum on the phase diagram except in the vicinity of the critical point, whereas $ u_m$ gives the minimum on the entire phase diagram.
We derive upper and lower bounds on the fidelity susceptibility in terms of macroscopic thermodynamical quantities, like susceptibilities and thermal average values. The quality of the bounds is checked by the exact expressions for a single spin in an external magnetic field. Their usefulness is illustrated by two examples of many-particle models which are exactly solved in the thermodynamic limit: the Dicke superradiance model and the single impurity Kondo model. It is shown that as far as divergent behavior is considered, the fidelity susceptibility and the thermodynamic susceptibility are equivalent for a large class of models exhibiting critical behavior.
Positive semidefinite rank (PSD-rank) is a relatively new quantity with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds on the PSD-rank. All of these bounds are based on viewing a positive semidefinite factorization of a matrix $M$ as a quantum communication protocol. These lower bounds depend on the entries of the matrix and not only on its support (the zero/nonzero pattern), overcoming a limitation of some previous techniques. We compare these new lower bounds with known bounds, and give examples where the new ones are better. As an application we determine the PSD-rank of (approximations of) some common matrices.
We give a simple quantitative condition, involving the mapping content of Azzam--Schul, that implies that a Lipschitz map from a Euclidean space to a metric space must be close to factoring through a tree. Using results of Azzam--Schul and the present authors, this gives simple checkable conditions for a Lipschitz map to have a large piece of its domain on which it behaves like an orthogonal projection. The proof involves new lower bounds and continuity statements for mapping content, and relies on a qualitative version of the main theorem recently proven by Esmayli--Haj{l}asz.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
