Hypergraph Packing and Graph Embedding

1999 ◽  
Vol 8 (4) ◽  
pp. 363-376 ◽  
Author(s):  
V. RÖDL ◽  
A. RUCIŃSKI ◽  
A. TARAZ
Keyword(s):  
Blow Up ◽  
Sufficient Conditions ◽  
Graph Embedding ◽  
The Other ◽  
Alternative Proof ◽  
Bounded Degree ◽  
Asymptotic Case ◽  
Bipartite Case

We provide sufficient conditions for packing two hypergraphs. The emphasis is on the asymptotic case when one of the hypergraphs has a bounded degree and the other is dense. As an application, we give an alternative proof for the bipartite case of the recently developed Blow-up Lemma [12].

Trees and nest structures

1966 ◽  
Vol 31 (3) ◽  
pp. 303-321 ◽  
Author(s):  
Raymond M. Smullyan
Keyword(s):  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
The Other ◽  
Alternative Proof ◽  
Nest Structure ◽  
Fundamental Lemma ◽  
Infinite Trees ◽  
Necessary And Sufficient ◽  
König’S Lemma

This paper is a sequel to [1]. Our purpose is to exhibit certain basic relationships between (ordered dyadic) trees and regular nest structures. We introduce the notion of a tree being isomorphic to a nest structure, and we study some necessary and sufficient conditions for the existence of such isomorphisms. By virtue of some of our results, Kónig's lemma on infinite trees, and our fundamental lemma of [1] concerning infinite regular nest structures become intimately related — either yields an alternative proof of the other.

scholarly journals Jordan products of quantum channels and their compatibility

2021 ◽  
Vol 12 (1) ◽  
Author(s):  
Mark Girard ◽  
Martin Plávala ◽  
Jamie Sikora
Keyword(s):  
Quantum State ◽  
Sufficient Conditions ◽  
The Other ◽  
Independent Interest ◽  
Quantum Channels ◽  
Semidefinite Programs ◽  
Jordan Product ◽  
Marginal Problem ◽  
Jordan Products ◽  
Product Of Matrices

AbstractGiven two quantum channels, we examine the task of determining whether they are compatible—meaning that one can perform both channels simultaneously but, in the future, choose exactly one channel whose output is desired (while forfeiting the output of the other channel). Here, we present several results concerning this task. First, we show it is equivalent to the quantum state marginal problem, i.e., every quantum state marginal problem can be recast as the compatibility of two channels, and vice versa. Second, we show that compatible measure-and-prepare channels (i.e., entanglement-breaking channels) do not necessarily have a measure-and-prepare compatibilizing channel. Third, we extend the notion of the Jordan product of matrices to quantum channels and present sufficient conditions for channel compatibility. These Jordan products and their generalizations might be of independent interest. Last, we formulate the different notions of compatibility as semidefinite programs and numerically test when families of partially dephasing-depolarizing channels are compatible.

scholarly journals Blow-up analyses in nonlocal reaction diffusion equations with time-dependent coefficients under Neumann boundary conditions

2020 ◽  
Vol 18 (1) ◽  
pp. 1552-1564
Author(s):  
Huimin Tian ◽  
Lingling Zhang
Keyword(s):  
Boundary Conditions ◽  
Blow Up ◽  
Sufficient Conditions ◽  
Neumann Boundary ◽  
Reaction Diffusion ◽  
Neumann Boundary Conditions ◽  
Reaction Diffusion Equations ◽  
Time Dependent ◽  
Diffusion Equations ◽  
Nonlocal Reaction

Abstract In this paper, the blow-up analyses in nonlocal reaction diffusion equations with time-dependent coefficients are investigated under Neumann boundary conditions. By constructing some suitable auxiliary functions and using differential inequality techniques, we show some sufficient conditions to ensure that the solution u ( x , t ) u(x,t) blows up at a finite time under appropriate measure sense. Furthermore, an upper and a lower bound on blow-up time are derived under some appropriate assumptions. At last, two examples are presented to illustrate the application of our main results.

scholarly journals On a New Geometric Constant Related to the Euler-Lagrange Type Identity in Banach Spaces

Mathematics ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 116
Author(s):  
Qi Liu ◽  
Yongjin Li
Keyword(s):  
Banach Spaces ◽  
Product Space ◽  
Sufficient Conditions ◽  
Normal Structure ◽  
The Other ◽  
Inner Product ◽  
Equivalent Characterization ◽  
Geometric Constant ◽  
Geometric Constants

In this paper, we will introduce a new geometric constant LYJ(λ,μ,X) based on an equivalent characterization of inner product space, which was proposed by Moslehian and Rassias. We first discuss some equivalent forms of the proposed constant. Next, a characterization of uniformly non-square is given. Moreover, some sufficient conditions which imply weak normal structure are presented. Finally, we obtain some relationship between the other well-known geometric constants and LYJ(λ,μ,X). Also, this new coefficient is computed for X being concrete space.

Index-Shuffle Graphs

1997 ◽  
Vol 08 (03) ◽  
pp. 289-304 ◽  
Author(s):  
Marc Baumslag ◽  
Bojana Obrenić
Keyword(s):  
Interconnection Networks ◽  
Graph Embedding ◽  
Theoretical Framework ◽  
Parallel Computers ◽  
Bounded Degree ◽  
Exchange Graph ◽  
Comparative Advantages ◽  
On Line

Index-shuffle graphs are introduced as candidate interconnection networks for parallel computers. The comparative advantages of index-shuffle graphs over the standard bounded-degree "approximations" of the hypercube, namely butterfly-like and shuffle-like graphs, are demonstrated in the theoretical framework of graph embedding and network emulations. An N-node index-shuffle graph emulates: • an N-node shuffle-exchange graph with no slowdown, which the currently best emulations of shuffle-like graphs by hypercubes and butterflies incur a slowdown of Ω( log N). • its like-sized butterfly graph with a slowdown O( log log log N), while the currently best emulations of butterfly-like graphs by shuffle-like graphs incur a slowdown of Ω( log log N). • an N-node hypercube that executes an on-line leveled algorithm with a slowdown O( log log N), while the slowdown of currently best such emulations of the hypercube by its bounded-degree shuffle-like and butterfly-like derivatives remains Ω( log N). Our emulation is based on an embedding of an N-node hypercube into an N-node index-shuffle graph with dilation O( log log N), while the currently best embeddings of the hypercube into its bounded-degree shuffle-like and butterfly-like derivatives incur a dilation of Ω( log N).

scholarly journals Blow-Up Analysis for the Periodic Two-Component μ-Hunter-Saxton System

2018 ◽  
Vol 2018 ◽  
pp. 1-11
Author(s):  
Yunxi Guo ◽  
Tingjian Xiong
Keyword(s):  
Transport Equation ◽  
Wave Breaking ◽  
Blow Up ◽  
Sufficient Conditions ◽  
Blow Up Analysis ◽  
Classic Method ◽  
Two Component ◽  
Localization Analysis ◽  
Spatially Periodic ◽  
Periodic Setting

The two-component μ-Hunter-Saxton system is considered in the spatially periodic setting. Firstly, a wave-breaking criterion is derived by employing the localization analysis of the transport equation theory. Secondly, several sufficient conditions of the blow-up solutions are established by using the classic method. The results obtained in this paper are new and different from those in previous works.

scholarly journals Equipartitioning and balancing points of polygons

Pythagoras ◽  
2010 ◽  
Vol 0 (71) ◽  
Author(s):  
Shunmugam Pillay ◽  
Poobhalan Pillay
Keyword(s):  
General Theorem ◽  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
The Other ◽  
Sufficient Condition ◽  
Centre Of Mass ◽  
Necessary And Sufficient Condition ◽  
Necessary And Sufficient

The centre of mass G of a triangle has the property that the rays to the vertices from G sweep out triangles having equal areas. We show that such points, termed equipartitioning points in this paper, need not exist in other polygons. A necessary and sufficient condition for a quadrilateral to have an equipartitioning point is that one of its diagonals bisects the other. The general theorem, namely, necessary and sufficient conditions for equipartitioning points for arbitrary polygons to exist, is also stated and proved. When this happens, they are in general, distinct from the centre of mass. In parallelograms, and only in them, do the two points coincide.

ON A THEOREM OF MISLIN

2001 ◽  
Vol 33 (3) ◽  
pp. 275-278 ◽  
Author(s):  
VICTOR P. SNAITH
Keyword(s):  
Sufficient Conditions ◽  
Necessary And Sufficient Conditions ◽  
Alternative Proof ◽  
Necessary And Sufficient

An alternative proof is given of a result, originally due to Guido Mislin, giving necessary and sufficient conditions for the inclusion of a subgroup to induce an isomorphism in mod p cohomology.

scholarly journals Wave Breaking Phenomenon for DGH Equation with Strong Dissipation

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
Zhengguang Guo ◽  
Min Zhao
Keyword(s):  
Finite Time ◽  
Wave Breaking ◽  
Blow Up ◽  
Sufficient Conditions ◽  
Strong Solutions ◽  
Dissipative Term

The present work is mainly concerned with the Dullin-Gottwald-Holm (DGH) equation with strong dissipative term. We establish some sufficient conditions to guarantee finite time blow-up of strong solutions.

Sign in / Sign up

Export Citation Format

Share Document