scholarly journals A Generalization of the Concavity of Rényi Entropy Power

Entropy ◽  
2021 ◽  
Vol 23 (12) ◽  
pp. 1593
Author(s):  
Laigang Guo ◽  
Chun-Ming Yuan ◽  
Xiao-Shan Gao
Keyword(s):  
Systematic Approach ◽  
Three Dimensional ◽  
Concave Function ◽  
Renyi Entropy ◽  
Rényi Entropy ◽  
Nonlinear Heat Equation ◽  
Necessary And Sufficient Condition ◽  
Probability Densities ◽  
Necessary And Sufficient ◽  
Special Case

Recently, Savaré-Toscani proved that the Rényi entropy power of general probability densities solving the p-nonlinear heat equation in Rn is a concave function of time under certain conditions of three parameters n,p,μ, which extends Costa’s concavity inequality for Shannon’s entropy power to the Rényi entropy power. In this paper, we give a condition Φ(n,p,μ) of n,p,μ under which the concavity of the Rényi entropy power is valid. The condition Φ(n,p,μ) contains Savaré-Toscani’s condition as a special case and much more cases. Precisely, the points (n,p,μ) satisfying Savaré-Toscani’s condition consist of a two-dimensional subset of R3, and the points satisfying the condition Φ(n,p,μ) consist a three-dimensional subset of R3. Furthermore, Φ(n,p,μ) gives the necessary and sufficient condition in a certain sense. Finally, the conditions are obtained with a systematic approach.

A Classification and Closure Properties of Languages for Describing Concurrent System Behaviours

1981 ◽  
Vol 4 (3) ◽  
pp. 531-549 ◽  
Author(s):  
Miklós Szijártó
Keyword(s):  
Formal Languages ◽  
Parallel Program ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Concurrent System ◽  
Closure Properties ◽  
Sequential Program ◽  
Necessary And Sufficient ◽  
Special Case ◽  
Independence Relations

The correspondence between sequential program schemes and formal languages is well known (Blikle and Mazurkiewicz (1972), Engelfriet (1974)). The situation is more complicated in the case of parallel program schemes, and trace languages (Mazurkiewicz (1977)) have been introduced to describe them. We introduce the concept of the closure of a language on a so called independence relation on the alphabet of the language, and formulate several theorems about them and the trace languages. We investigate the closedness properties of Chomsky classes under closure on independence relations, and as a special case we derive a new necessary and sufficient condition for the regularity of the commutative closure of a language.

scholarly journals On the forces that cable webs under tension can support and how to design cable webs to channel stresses

2019 ◽  
Vol 475 (2223) ◽  
pp. 20180781 ◽  
Author(s):  
Guy Bouchitté ◽  
Ornella Mattei ◽  
Graeme W. Milton ◽  
Pierre Seppecher
Keyword(s):  
Linear Programming ◽  
Convex Hull ◽  
Structural Engineering ◽  
Three Dimensional ◽  
Two Dimensions ◽  
Three Dimensions ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Finite Dimensional ◽  
Necessary And Sufficient

In many applications of structural engineering, the following question arises: given a set of forces f 1 ,  f 2 , …,  f N applied at prescribed points x 1 ,  x 2 , …,  x N , under what constraints on the forces does there exist a truss structure (or wire web) with all elements under tension that supports these forces? Here we provide answer to such a question for any configuration of the terminal points x 1 ,  x 2 , …,  x N in the two- and three-dimensional cases. Specifically, the existence of a web is guaranteed by a necessary and sufficient condition on the loading which corresponds to a finite dimensional linear programming problem. In two dimensions, we show that any such web can be replaced by one in which there are at most P elementary loops, where elementary means that the loop cannot be subdivided into subloops, and where P is the number of forces f 1 ,  f 2 , …,  f N applied at points strictly within the convex hull of x 1 ,  x 2 , …,  x N . In three dimensions, we show that, by slightly perturbing f 1 ,  f 2 , …,  f N , there exists a uniloadable web supporting this loading. Uniloadable means it supports this loading and all positive multiples of it, but not any other loading. Uniloadable webs provide a mechanism for channelling stress in desired ways.

scholarly journals Bracing Zonohedra With Special Faces

2015 ◽  
Vol 3 (1-2) ◽  
pp. 88-95 ◽  
Author(s):  
Gyula Nagy
Keyword(s):  
Convex Polyhedron ◽  
Three Dimensional ◽  
Equivalence Classes ◽  
Frame Structure ◽  
Sufficient Condition ◽  
Preliminary Design ◽  
Necessary And Sufficient Condition ◽  
Special Assumption ◽  
Centrally Symmetric ◽  
Necessary And Sufficient

Abstract The analysis of simpler preliminary design gives useful input for more complicated three-dimensional building frame structure. A zonohedron, as a preliminary structure of design, is a convex polyhedron for which each face possesses central symmetry. We considered zonohedron as a special framework with the special assumption that the polygonal faces can be deformed in such a way that faces remain planar and centrally symmetric, moreover the length of all edges remains unchanged. Introducing some diagonal braces we got a new mechanism. This paper deals with the flexibility of this kind of mechanisms, and investigates the rigidity of the braced framework. The flexibility of the framework can be characterized by some vectors, which represent equivalence classes of the edges. A necessary and sufficient condition for the rigidity of the braced rhombic face zonohedra is posed. A real mechanical construction, based on two simple elements, provides a CAD prototype of these new mechanisms.

scholarly journals On composition of formal power series

2002 ◽  
Vol 30 (12) ◽  
pp. 761-770 ◽  
Author(s):  
Xiao-Xiong Gan ◽  
Nathaniel Knox
Keyword(s):  
Power Series ◽  
Formal Power Series ◽  
Open Problem ◽  
Constant Term ◽  
Radius Of Convergence ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient ◽  
Formal Power ◽  
Special Case

Given a formal power seriesg(x)=b0+b1x+b2x2+⋯and a nonunitf(x)=a1x+a2x2+⋯, it is well known that the composition ofgwithf,g(f(x)), is a formal power series. If the formal power seriesfabove is not a nonunit, that is, the constant term offis not zero, the existence of the compositiong(f(x))has been an open problem for many years. The recent development investigated the radius of convergence of a composed formal power series likefabove and obtained some very good results. This note gives a necessary and sufficient condition for the existence of the composition of some formal power series. By means of the theorems established in this note, the existence of the composition of a nonunit formal power series is a special case.

On the general bilinear time series model

1988 ◽  
Vol 25 (3) ◽  
pp. 553-564 ◽  
Author(s):  
Jian Liu ◽  
Peter J. Brockwell
Keyword(s):  
Time Series ◽  
Stationary Solution ◽  
Time Series Model ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Special Cases ◽  
Non Linear ◽  
Necessary And Sufficient ◽  
Special Case

A sufficient condition is derived for the existence of a strictly stationary solution of the general bilinear time series equations. The condition is shown to reduce to the conditions of Pham and Tran (1981) and Bhaskara Rao et al. (1983) in the special cases which they consider. Under the condition specified, a solution is constructed which is shown to be causal, stationary and ergodic. It is moreover the unique causal solution and the unique stationary solution of the defining equations. In the special case when the defining equations contain no non-linear terms, our condition reduces to the well-known necessary and sufficient condition for existence of a causal stationary solution.

YAMABE TYPE EQUATIONS ON THREE DIMENSIONAL RIEMANNIAN MANIFOLDS

1999 ◽  
Vol 01 (01) ◽  
pp. 1-50 ◽  
Author(s):  
YANYAN LI ◽  
MEIJUN ZHU
Keyword(s):  
Riemannian Manifolds ◽  
Compact Riemannian Manifold ◽  
Three Dimensional ◽  
Higher Dimensions ◽  
Dimensional Sphere ◽  
Compact Set ◽  
Curvature Function ◽  
Necessary And Sufficient Condition ◽  
All Solutions ◽  
Necessary And Sufficient

A theorem of Escobar and Schoen asserts that on a positive three dimensional smooth compact Riemannian manifold which is not conformally equivalent to the standard three dimensional sphere, a necessary and sufficient condition for a C2 function K to be the scalar curvature function of some conformal metric is that K is positive somewhere. We show that for any positive C2 function K, all such metrics stay in a compact set with respect to C3 norms and the total Leray-Schauder degree of all solutions is equal to -1. Such existence and compactness results no longer hold in such generality in higher dimensions or on manifolds conformally equivalent to standard three dimensional spheres. The results are also established for more general Yamabe type equations on three dimensional manifolds.

∗-Ricci tensor on almost Kenmotsu 3-manifolds

2020 ◽  
Vol 17 (13) ◽  
pp. 2050196
Author(s):  
Dibakar Dey ◽  
Pradip Majhi
Keyword(s):  
Lie Group ◽  
Ricci Tensor ◽  
Three Dimensional ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Addition Formula ◽  
Kenmotsu Manifold ◽  
Ricci Operator ◽  
Necessary And Sufficient ◽  
Parallel Ricci Tensor

In this paper, we obtain the expressions of the ∗-Ricci operator of a three-dimensional almost Kenmotsu manifold [Formula: see text] and find that the ∗-Ricci tensor is not symmetric for [Formula: see text]. We obtain a necessary and sufficient condition for the ∗-Ricci tensor to be symmetric and proved that if the ∗-Ricci tensor of a non-Kenmotsu almost Kenmotsu 3-[Formula: see text]-manifold [Formula: see text] is symmetric, then [Formula: see text] is locally isometric to a three-dimensional non-unimodular Lie group equipped with a left invariant non-Kenmotsu almost Kenmotsu structure. Further, it is shown that the ∗-Ricci tensor of a non-Kenmotsu almost Kenmotsu 3-manifold [Formula: see text] is parallel if and only if [Formula: see text] is ∗-Ricci flat. In addition, [Formula: see text] satisfying [Formula: see text] is locally isometric to [Formula: see text]. Finally, we discuss about [Formula: see text]-parallel ∗-Ricci tensor on almost Kenmotsu 3-manifolds.

scholarly journals A necessary and sufficient condition for global existence for a quasilinear reaction-diffusion system

2005 ◽  
Vol 2005 (11) ◽  
pp. 1809-1818 ◽  
Author(s):  
Alan V. Lair
Keyword(s):  
Global Solution ◽  
Smooth Boundary ◽  
Neumann Boundary ◽  
Reaction Diffusion ◽  
Reaction Diffusion System ◽  
Diffusion System ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient ◽  
Special Case

We show that the reaction-diffusion systemut=Δφ(u)+f(v),vt=Δψ(v)+g(u), with homogeneous Neumann boundary conditions, has a positive global solution onΩ×[0,∞)if and only if∫∞ds/f(F−1(G(s)))=∞(or, equivalently,∫∞ds/g(G−1(F(s)))=∞), whereF(s)=∫0sf(r)drandG(s)=∫0sg(r)dr. The domainΩ⊆ℝN(N≥1)is bounded with smooth boundary. The functionsφ,ψ,f, andgare nondecreasing, nonnegativeC([0,∞))functions satisfyingφ(s)ψ(s)f(s)g(s)>0fors>0andφ(0)=ψ(0)=0. Applied to the special casef(s)=spandg(s)=sq,p>0,q>0, our result proves that the system has a global solution if and only ifpq≤1.

scholarly journals Characterization of $[1,k]$-Bar Visibility Trees

10.37236/1116 ◽  
2006 ◽  
Vol 13 (1) ◽  
Author(s):  
Guantao Chen ◽  
Joan P. Hutchinson ◽  
Ken Keating ◽  
Jian Shen
Keyword(s):  
Knapsack Problem ◽  
Unit Length ◽  
Sufficient Condition ◽  
Necessary And Sufficient Condition ◽  
Visibility Representation ◽  
Visibility Graphs ◽  
Necessary And Sufficient ◽  
Positive Integers ◽  
Special Case

A unit bar-visibility graph is a graph whose vertices can be represented in the plane by disjoint horizontal unit-length bars such that two vertices are adjacent if and only if there is a unobstructed, non-degenerate, vertical band of visibility between the corresponding bars. We generalize unit bar-visibility graphs to $[1,k]$-bar-visibility graphs by allowing the lengths of the bars to be between $1/k$ and $1$. We completely characterize these graphs for trees. We establish an algorithm with complexity $O(kn)$ to determine whether a tree with $n$ vertices has a $[1,k]$-bar-visibility representation. In the course of developing the algorithm, we study a special case of the knapsack problem: Partitioning a set of positive integers into two sets with sums as equal as possible. We give a necessary and sufficient condition for the existence of such a partition.

Sign in / Sign up

Export Citation Format

Share Document