Related papers: Energy bounds for codes and designs in Hamming spa…
Let $A_q(n,d)$ be the maximum order (maximum number of codewords) of a $q$-ary code of length $n$ and Hamming distance at least $d$. And let $A(n,d,w)$ that of a binary code of constant weight $w$. Building on results from algebraic graph…
Power and efficiency are fundamental criteria for evaluating the performance of thermodynamic cycles. However, it is generally impossible to maximize both simultaneously. In particular, achieving maximum efficiency inevitably leads to…
Geometric and topological bounds are obtained for the first energy level gap of a particle constrained to move on a compact surface in 3-space. Moreover, geometric properties are found which allows for stationary and uniformly distributed…
A solution to the quantum Zermelo problem for control Hamiltonians with general energy resource bounds is provided. Interestingly, the energy resource of the control Hamiltonian and the control time define a pair of conjugate variables that…
In a recent paper [J. Math. Phys. 47 082303 (2006)], Quantum Energy Inequalities were used to place simple geometrical bounds on the energy densities of quantum fields in Minkowskian spacetime regions. Here, we refine this analysis for…
Explicit characterization and computation of the multi-source network coding capacity region (or even bounds) is long standing open problem. In fact, finding the capacity region requires determination of the set of all entropic vectors…
A proof is given that if the nonlinear Schrodinger wave function is constrained to have support over only a finite volume in configuration space, then the total energy is bounded from below for either sign of the logarithmic term in the…
We study harmonic maps from degenerating Riemann surfaces with uniformly bounded energy and show the so-called generalized energy identity. We find conditions that are both necessary and sufficient for the compactness in $W^{1,2}$ and…
We obtain a series of lower bounds for the product set of combinatorial cubes, as well as some non--trivial upper estimates for the multiplicative energy of such sets.
We continue our study of the stability of designer gravity theories, where one considers anti-de Sitter gravity coupled to certain tachyonic scalars with boundary conditions defined by a smooth function W. It has recently been argued there…
We derive a bound on the total number of negative energy bound states in a potential in two spatial dimensions by using an adaptation of the Schwinger method to derive the Birman-Schwinger bound in three dimensions. Specifically, counting…
In this short note we give a new upper bound for the size of a set family with a single Hamming distance. Our proof is an application of the linear algebra bound method.
The physical limits to computation have been under active scrutiny over the past decade or two, as theoretical investigations of the possible impact of quantum mechanical processes on computing have begun to make contact with realizable…
We present some results about harmonic maps with possibly infinite energy from punctured Riemann surfaces to CAT(0) spaces. In particular, we give precise estimates of their energy growth near the punctures and prove their uniqueness.
We derive upper bounds to free-space concentration of electromagnetic waves, mapping out the limits to maximum intensity for any spot size and optical beam-shaping device. For sub-diffraction-limited optical beams, our bounds suggest the…
A novel method for deriving energy conditions in stable field theories is described. In a local classical theory with one spatial dimension, a local energy condition always exists. For a relativistic field theory, one obtains the dominant…
By means of a generalization of the Fefferman-de la Llave decomposition we derive a general lower bound on the interaction energy of one-dimensional quantum systems. We apply this result to a specific class of lowest Landau band wave…
We propose to use the concept of the Hamming bound to derive the optimal criteria for learning hash codes with a deep network. In particular, when the number of binary hash codes (typically the number of image categories) and code length…
We consider a constrained optimization problem arising from the study of the Helmholtz equation in unbounded domains. The optimization problem provides an approximation of the solution in a bounded computational domain. In this paper we…
This paper studies the cardinality of codes correcting insertions and deletions. We give improved upper and lower bounds on code size. Our upper bound is obtained by utilizing the asymmetric property of list decoding for insertions and…