Related papers: Lagrangians, Renormalization, and Quantization in …
I show how applying a symplectic Gram-Schmidt orthogonalization to the normalizer of a quantum code gives a different way of determining the code's logical operators. This approach may be more natural in the setting where we produce a…
We consider the distributed compression of Soft Random Geometric Graphs (SRGGs) above the connectivity threshold. We establish the Slepian-Wolf rate region for the SRGG in the setting where there are a finite number of encoders compressing…
It is possible to introduce external time dependent back ground fields in the formulation of a system as fields whose dynamics can not be deduced from Euler Lagrange equations of motion. This method leads to singular Lagrangians for real…
Bayesian inference requires approximation methods to become computable, but for most of them it is impossible to quantify how close the approximation is to the true posterior. In this work, we present a theorem upper-bounding the KL…
A property of prefix codes called strong monotonicity is introduced, and it is proven that for a given source, a prefix code is optimal if and only if it is complete and strongly monotone.
We establish quantitative homogenization results for the popular log-normal coefficients. Since the coefficients are neither bounded nor uniformly elliptic, standard proofs do not apply directly. Instead, we take inspiration from the…
We introduce a general method for relaxing decision diagrams that allows one to bound job sequencing problems by solving a Lagrangian dual problem on a relaxed diagram. We also provide guidelines for identifying problems for which this…
Generalizing the 't Hooft and Veltman method of unitary regulators, we demonstrate for the first time the existence of local, Lorentz-invariant, physically motivated Lagrangians of quantum-electrodynamic phenomena such that: (i) Feynman…
We examine two central regularization strategies for monotone variational inequalities, the first a direct regularization of the operative monotone mapping, and the second via regularization of the associated dual gap function. A key link…
We consider bounded weak solutions to the Burgers equation for which every entropy dissipation is representable by a measure and we prove that all these measures are concentrated on the graphs of countably many Lipschitz curves. The main…
We develop a renormalization group for weak Harris-marginal disorder in otherwise strongly interacting quantum critical theories, focusing on systems which have emergent conformal invariance. Using conformal perturbation theory, we argue…
We investigate the Exact Renormalization Group (ERG) description of ($Z_2$ invariant) one-component scalar field theory, in the approximation in which all momentum dependence is discarded in the effective vertices. In this context we show…
We classify the unitary, renormalizable, Lorentz violating quantum field theories of interacting scalars and fermions, obtained improving the behavior of Feynman diagrams by means of higher space derivatives. Higher time derivatives are not…
The Einstein-Hilbert Lagrangian for gravity is non-renormalizable at loop level. However, it can be treated in the effective field theory framework which means that gravity as an effective theory can be renormalized when a proper expansion…
We present an extension of the functional renormalization group (FRG) framework developed to compute critical probability distributions of the order parameter to momentum-dependent observables. Focusing on the constraint effective action at…
Generalizing the 't Hooft and Veltman method of unitary regulators, we demonstrate for the first time the existence of local, Lorentz-invariant, physically motivated Lagrangians of quantum-electrodynamic phenomena such that: (i) Feynman…
$S$-matrix elements are invariant under field redefinitions of the Lagrangian. They are determined by geometric quantities such as the curvature of the field-space manifold of scalar and gauge fields. We present a formalism where scalar and…
In this paper non-asymptotic exact rearrangement invariant norm estimates are derived for the maximum distribution of the family elements of some rearrangement invariant (r.i.) space over unbounded measure in the entropy terms and in the…
Consensus is a common method for computing a function of the data distributed among the nodes of a network. Of particular interest is distributed average consensus, whereby the nodes iteratively compute the sample average of the data stored…
Normalization of polynomials plays a vital role in the approximate basis computation of vanishing ideals. Coefficient normalization, which normalizes a polynomial with its coefficient norm, is the most common method in computer algebra.…