1,538 research outputs found
Nearly cloaking the elastic wave fields
In this work, we develop a general mathematical framework on regularized
approximate cloaking of elastic waves governed by the Lam\'e system via the
approach of transformation elastodynamics. Our study is rather comprehensive.
We first provide a rigorous justification of the transformation elastodynamics.
Based on the blow-up-a-point construction, elastic material tensors for a
perfect cloak are derived and shown to possess singularities. In order to avoid
the singular structure, we propose to regularize the blow-up-a-point
construction to be the blow-up-a-small-region construction. However, it is
shown that without incorporating a suitable lossy layer, the regularized
construction would fail due to resonant inclusions. In order to defeat the
failure of the lossless construction, a properly designed lossy layer is
introduced into the regularized cloaking construction . We derive sharp
asymptotic estimates in assessing the cloaking performance. The proposed
cloaking scheme is capable of nearly cloaking an arbitrary content with a high
accuracy
Long properly colored cycles in edge colored complete graphs
Let denote a complete graph on vertices whose edges are
colored in an arbitrary way. Let denote the
maximum number of edges of the same color incident with a vertex of
. A properly colored cycle (path) in is a cycle (path)
in which adjacent edges have distinct colors. B. Bollob\'{a}s and P. Erd\"{o}s
(1976) proposed the following conjecture: if , then contains a properly
colored Hamiltonian cycle. Li, Wang and Zhou proved that if
, then
contains a properly colored cycle of length at least . In this paper, we improve the bound to .Comment: 8 page
List version of (,1)-total labellings
The (,1)-total number of a graph is the width of the
smallest range of integers that suffices to label the vertices and the edges of
such that no two adjacent vertices have the same label, no two incident
edges have the same label and the difference between the labels of a vertex and
its incident edges is at least . In this paper we consider the list version.
Let be a list of possible colors for all . Define
to be the smallest integer such that for every list
assignment with for all , has a
(,1)-total labelling such that for all . We call the (,1)-total labelling choosability and
is list -(,1)-total labelable. In this paper, we present a conjecture on
the upper bound of . Furthermore, we study this parameter for paths
and trees in Section 2. We also prove that for
star with in Section 3 and for outerplanar graph with in Section 4.Comment: 11 pages, 2 figure
Oscillation of Nonlinear Delay Partial Difference Equations
In this paper, we consider certain nonlinear partial difference equationswhere , is a positive integer, are positive real sequences. . A new comparison theorem for oscillation of the above equation is obtained
Nonoscillation Theorems for a Class of Fourth Order Quasilinear Dynamic Equations on Time Scales
In this paper,some sufficient and necessary conditions for nonoscillation of the fourth order quasilinear dynamic equations on time scales T are established. Our results as special case when T = R and T = N,involve and improve some known results
- β¦