Related papers: Symmetric-Convex Functionals of Linear Growth
In this note we present some ideas on when Lie symmetries, both point and generalized, can depend on arbitrary functions. We show on a few examples, both in partial differential and partial difference equations when this happens. Moreover…
In this work, we look at the symmetry of normal modes in symmetric structures, particularly structures with cyclic symmetry. We show that normal modes of symmetric structures have different levels of symmetry, or symmetricity. One novel…
Augmented Lagrangian Methods (ALMs) are widely employed in solving constrained optimizations, and some efficient solvers are developed based on this framework. Under the quadratic growth assumption, it is known that the dual iterates and…
Let K,S,D be a division ring, an endomorphism and a S-derivation of K, respectively. In this setting we introduce generalized noncommutative symmetric functions and obtain Vieta formula and decompositions of differential operators.…
We solve the following three problems. 1. How much can the radial growth of an entire function $f$ be reduced by multiplying it by some nonzero entire function? We give the answer in terms of the growth of the integral means of $\ln|f|$…
Symplectic integration of autonomous Hamiltonian systems is a well-known field of study in geometric numerical integration, but for non-autonomous systems the situation is less clear, since symplectic structure requires an even number of…
The aim of the paper is to show that the solutions to variational problems with non-standard growth conditions satisfy a corresponding variational inequality without any smallness assumptions on the gap between growth and coercitivity…
An approximation, in the sense of $\Gamma$-convergence and in any dimension $d\geq1$, of Griffith-type functionals, with $p-$growth ($p>1$) in the symmetrized gradient, is provided by means of a sequence of non-local integral functionals…
Properties of 2-dimensional generalizations of sine functions that are symmetric or antisymmetric with respect to permutation of their two variables are described. It is shown that the functions are orthogonal when integrated over a finite…
The multiplex network growth literature has been confined to homogeneous growth hitherto, where the number of links that each new incoming node establishes is the same across layers. This paper focuses on heterogeneous growth. We first…
It is shown that, by imposing reparametrization invariance, one may derive a variety of stochastic equations describing the dynamics of surface growth and identify the physical processes responsible for the various terms. This approach…
We prove that linearizing certain families of polynomial optimization problems leads to new functorial operations in real convex sets. We show that under some conditions these operations can be computed or approximated in ways amenable to…
We consider a space of infinitely smooth functions on an unbounded closed convex set in ${\mathbb R}^n$. It is shown that each function of this space can be extended to an entire function in ${\mathbb C}^n$ satisfying some prescribed growth…
Let L be a bounded distributive lattice. We give several characterizations of those L^n --> L mappings that are polynomial functions, i.e., functions which can be obtained from projections and constant functions using binary joins and…
This paper focuses on the problem of growing multiplex networks. Currently, the results on the joint degree distribution of growing multiplex networks present in the literature pertain to the case of two layers, and are confined to the…
As well known, classical catenoids in ${\mathbf{R}}^3$ possess logarithmic growth at infinity. In this note we prove that the case of nonlocal minimal surfaces is significantly different, and indeed all nonlocal catenoids must grow at least…
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification…
We report a new algorithm to generate Laplacian Growth Patterns using iterated conformal maps. The difficulty of growing a complete layer with local width proportional to the gradient of the Laplacian field is overcome. The resulting growth…
We discuss technical results on learning function approximations using piecewise-linear basis functions, and analyze their stability and convergence using nonlinear contraction theory.
We establish that the Dirichlet problem for convex linear growth functionals on $BD$, the functions of bounded deformation, gives rise to the same unconditional Sobolev and partial $C^{1,\alpha}$-regularity theory as presently available for…