Approximate Diagonal Integral Representations and Eigenmeasures for Lipschitz Operators on Banach Spaces

A new stochastic approach for the approximation of (nonlinear) Lipschitz operators in normed spaces by their eigenvectors is shown. Different ways of providing integral representations for these approximations are proposed, depending on the properties of the operators themselves whether they are locally constant, (almost) linear, or convex. We use the recently introduced notion of eigenmeasure and focus attention on procedures for extending a function for which the eigenvectors are known, to the whole space. We provide information on natural error bounds, thus giving some tools to measure to what extent the map can be considered diagonal with few errors. In particular, we show an approximate spectral theorem for Lipschitz operators that verify certain convexity properties.

Feedback Optimality Condition for Nonconvex Discrete Linear-Quadratic Optimal Control Problem

The paper analyzed a non-convex linear-quadratic optimization problem in a discrete dynamic system. We obtained necessary optimality condition with feedback controls which allow a descent of the functional cost. Such controls are generated by the quadratic majorant of the cost. In contrast to the discrete maximum principle, this condition does not require any convexity properties of the problem.

Generalized Convexity Properties and Shape-Based Approximation in Networks Reliability

Some properties of generalized convexity for sets and functions are identified in case of the reliability polynomials of two dual minimal networks. A method of approximating the reliability polynomials of two dual minimal network is developed based on their mutual complementarity properties. The approximating objects are from the class of quadratic spline functions, constructed based on both interpolation conditions and shape knowledge. It is proved that the approximant objects preserve both the high-order convexity and some extremum properties of the exact reliability polynomials. It leads to pointing out the area of the network where the maximum number of paths is achieved. Numerical examples and simulations show the performance of the algorithm, both in terms of low complexity, small error and shape preserving. Possibilities of increasing the accuracy of approximation are discussed.

More on the weak gravity conjecture via convexity of charged operators

The Weak Gravity Conjecture has recently been re-formulated in terms of a particle with non-negative self-binding energy. Because of the dual conformal field theory (CFT) formulation in the anti-de Sitter space, the conformal dimension ∆(Q) of the lowest-dimension operator with charge Q under some global U(1) symmetry must be a convex function of Q. This property has been conjectured to hold for any (unitary) conformal field theory and generalized to larger global symmetry groups. Here we refine and further test the convex charge conjecture via semiclassical computations for fixed charge sectors of different theories in various dimensions. We analyze the convexity properties of the leading and next-to-leading order terms stemming from the semiclassical computation, de facto, extending previous tests beyond the leading perturbative contributions and to arbitrary charges. In particular, the leading contribution is sufficient to test convexity in the semiclassical computations. We also consider intriguing cases in which the models feature a transition from real to complex conformal dimensions either as a function of the charge or number of matter fields. As a relevant example of the first kind, we investigate the O(N) model in 4 + ϵ dimensions. As an example of the second type, we consider the U(N) × U(M) model in 4 − ϵ dimensions. Both models display a rich dynamics where, by changing the number of matter fields and/or charge, one can achieve dramatically different physical regimes. We discover that whenever a complex conformal dimension appears, the real part satisfies the convexity property.

The second law of thermodynamics as variation on a theme of Carathéodory

This paper revisits the second law of thermodynamics via certain modifications of the axiomatic foundation provided by the celebrated 1909 work of Carathéodory. It is shown that his postulate of adiabatic inaccessibility represents one of several constraints on the energy balance that serve to establish the existence of thermostatic entropy as a foliation of state space, with temperature representing a force of constraint. To achieve the thermostatic version of the second law, as embodied in the postulates of Clausius and Gibbs, work principles are proposed to define thermostatic equilibrium and stability in terms of the convexity properties of internal energy, entropy and related thermostatic potentials. Comparisons are made with the classic work of Coleman and Noll on thermostatic equilibrium in simple continua, resulting in a few unresolved differences. Perhaps the most novel aspect of the current work is an extension to irreversible processes by means of a non-equilibrium entropy derived from recoverable work, which generalizes similar ideas in continuum viscoelasticity. This definition of entropy calls for certain revisions of modern theories of continuum thermomechanics by Coleman, Noll and others that are based on a generally inaccessible entropy and undefined temperature.

Nonclassical trajectories in head-on collisions

Rutherford scattering is usually described by treating the projectile either classically or as quantum mechanical plane waves. Here we treat them as wave packets and study their head-on collisions with the stationary target nuclei. We simulate the quantum dynamics of this one-dimensional system and study deviations of the average quantum solution from the classical one. These deviations are traced back to the convexity properties of Coulomb potential. Finally, we sketch how these theoretical findings could be tested in experiments looking for the onset of nuclear reactions.

Some Geometric Properties of a Hyperbolic Univalent Function

In this paper, we analyze several aspects of a hyperbolic univalent function related to convexity properties, by assuming to be the univalent holomorphic function maps of the unit disk onto the hyperbolic convex region ( is an open connected subset of). This assumption leads to the coverage of some of the findings that are started by seeking a convex univalent function distortion property to provide an approximation of the inequality and confirm the form of the lower bound for . A further result was reached by combining the distortion and growth properties for increasing inequality . From the last result, we wanted to demonstrate the effect of the unit disk image on the condition of convexity estimation by proving the two inequalities of , and .

Inequalities for generalized divisor functions

We offer inequalities to $\sigma_a(n)$ as a function of the real variable $a$: Monotonicity and convexity properties to this and related functions are proved, too. Extensions and improvements of known results are provided.

Interpolation of Weighted Extremal Functions

An approach to interpolation of compact subsets of $${{\mathbb {C}}}^n$$ C n , including Brunn–Minkowski type inequalities for the capacities of the interpolating sets, was developed in [8] by means of plurisubharmonic geodesics between relative extremal functions of the given sets. Here we show that a much better control can be achieved by means of the geodesics between weighted relative extremal functions. In particular, we establish convexity properties of the capacities that are stronger than those given by the Brunn–Minkowski inequalities.