Generalized 3G theorem and application to relativistic stable process on non-smooth open sets

Let G(x,y) and GD(x,y) be the Green functions of rotationally invariant symmetric α-stable process in Rd and in an open set D, respectively, where 0<α<2. The inequality GD(x,y)GD(y,z)/GD(x,z)?c(G(x,y)+G(y,z)) is a very useful tool in studying (local) Schrödinger operators. When the above inequality is true with c=c(D)∈(0,∞), then we say that the 3G theorem holds in D. In this paper, we establish a generalized version of 3G theorem when D is a bounded κ-fat open set, which includes a bounded John domain. The 3G we consider is of the form GD(x,y)GD(z,w)/GD(x,w), where y may be different from z. When y=z, we recover the usual 3G. The 3G form GD(x,y)GD(z,w)/GD(x,w) appears in non-local Schrödinger operator theory. Using our generalized 3G theorem, we give a concrete class of functions belonging to the non-local Kato class, introduced by Chen and Song, on κ-fat open sets. As an application, we discuss relativistic α-stable processes (relativistic Hamiltonian when α=1) in κ-fat open sets. We identify the Martin boundary and the minimal Martin boundary with the Euclidean boundary for relativistic α-stable processes in κ-fat open sets. Furthermore, we show that relative Fatou type theorem is true for relativistic stable processes in κ-fat open sets. The main results of this paper hold for a large class of symmetric Markov processes, as are illustrated in the last section of this paper. We also discuss the generalized 3G theorem for a large class of symmetric stable Lévy processes.     

Characterization and recognition of generalized clique-Helly graphs

Let p?1 and q?0 be integers. A family of sets F is (p,q)-intersecting when every subfamily F^′⊆F formed by p or less members has total intersection of cardinality at least q. A family of sets F is (p,q)-Helly when every (p,q)-intersecting subfamily F^′⊆F has total intersection of cardinality at least q. A graph G is a (p,q)-clique-Helly graph when its family of (maximal) cliques is (p,q)-Helly. According to this terminology, the usual Helly property and the clique-Helly graphs correspond to the case p=2,q=1. In this work we present a characterization for (p,q)-clique-Helly graphs. For fixed p,q, this characterization leads to a polynomial-time recognition algorithm. When p or q is not fixed, it is shown that the recognition of (p,q)-clique-Helly graphs is NP-hard.     

Signed degree sets in signed graphs

The set D of distinct signed degrees of the vertices in a signed graph G is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also prove that every non-empty set of integers is the signed degree set of some connected signed graph.     

哈密顿算符的对角化与能量本征值问题的代数解法

提出了将哈密顿算符对角化的一种方法.围绕一维谐振子讨论了如何将哈密顿算符对角化、引进的是玻色算符还是费米算符的问题,并分析了能量量子化的原因及能量子与声子的区别.     

On Extracting Maximum Stable Sets in Perfect Graphs Using Lovász's Theta Function

We study the maximum stable set problem. For a given graph, we establish several transformations among feasible solutions of different formulations of Lovász's theta function. We propose reductions from feasible solutions corresponding to a graph to those corresponding to its induced subgraphs. We develop an efficient, polynomial-time algorithm to extract a maximum stable set in a perfect graph using the theta function. Our algorithm iteratively transforms an approximate solution of the semidefinite formulation of the theta function into an approximate solution of another formulation, which is then used to identify a vertex that belongs to a maximum stable set. The subgraph induced by that vertex and its neighbors is removed and the same procedure is repeated on successively smaller graphs. We establish that solving the theta problem up to an adaptively chosen, fairly rough accuracy suffices in order for the algorithm to work properly. Furthermore, our algorithm successfully employs a warm-start strategy to recompute the theta function on smaller subgraphs. Computational results demonstrate that our algorithm can efficiently extract maximum stable sets in comparable time it takes to solve the theta problem on the original graph to optimality. This work was supported in part by NSF through CAREER Grant DMI-0237415. Part of this work was performed while the first author was at the Department of Applied Mathematics and Statisticsat Stony Brook University, Stony Brook, NY, USA.     

Velocity Quantization Approach of the One-Dimensional Dissipative Harmonic Oscillator

Given a constant of motion for the one-dimensional harmonic oscillator with linear dissipation in the velocity, the problem to get the Hamiltonian for this system is pointed out, and the quantization up to second order in the perturbation approach is used to determine the modification on the eigenvalues when dissipation is taken into consideration. This quantization is realized using the constant of motion instead of the Hamiltonian. PACS: 03.20.+i, 03.30.+p, 03.65.−w,03.65.Ca     

DISSIPATIVE SCHEMES WITH PROPERTY OF INHERITING HOMOCLINIC ORBITS FOR 2N-DIMENSIONAL HAMILTONIAN SYSTEMS

1　ＩｎｔｒｏｄｕｃｔｉｏｎＴｈｉｓｐａｐｅｒｉｓｄｅｖｏｔｅｄｔｏｓｔｕｄｙｗｈａｔｋｉｎｄｏｆｄｉｓｃｒｅｔｅｓｃｈｅｍｅｓｏｆｔｈｅｆｏｌｌｏｗｉｎｇ 2ｎ ｄｉｍｅｎ ｓｉｏｎａｌＨａｍｉｌｔｏｎｉａｎｓｙｓｔｅｍｓｗｉｔｈｐａｒａｍｅｔｅｒｉｎｎｏｒｍａｌｆｏｒｍ ｕ=Ｊ2ｎ Ｈ ｕＴ,　　Ｈ =Ｈ(ｕ ,λ) ,(1 )ｗｈｅｒｅｕ∈Ｒ2ｎ,λ∈Ｒ ,Ｈ∈Ｃｋ+1(Ｒ2ｎ×Ｒ ,Ｒ) ,ｋ≥ 6,ａｎｄＪ2ｎ =0Ｉｎ-Ｉｎ 0 ,Ｉｎ:ｕｎｉｔｍａｔｒｉｘｏｆｏｒｄｅｒｎｈａｓｔｈｅｐｒｏｐｅｒｔｙｏｆｉｎｈｅｒｉｔｉｎｇｈｏｍ…     

Graphs with Special Arcs and Cryptography

A combinatorial method of encryption with a similarity to the classical scheme of linear coding has been suggested by the author. The general idea is to treat vertices of a graph as messages and arcs of a certain length as encryption tools. We will study the quality of such an encryption in the case of graphs of high girth by comparing the probability to guess the message, (vertex) at random with the probability of breaking the key, i.e. guessing the encoding arc. In fact, the quality is good for graphs which are close to the Erdös bound, defined by the Even Cycle Theorem.In the case of parallelotopic graphs, there is a uniform way to match arcs with strings in a certain alphabet. Among parallelotopic graphs we distinguish linguistic graphs of affine type whose vertices (messages) and arcs (encoding tools) both could be naturally identified with vectors over the GF(q), and neighbors of the vertex defined by a system of linear equations. We will discuss families of linguistic and parallelotopic graphs of increasing girth as the source for assymmetric cryptographic functions and related open key algorithms.Several constructions of families of linguistic graphs of high girth with good quality, complexity and expansion coefficients will be considered. Some of those constructions have been obtained via group-theoretical and geometrical techniques.     

Using graphs for some discrete tomography problems

Given a rectangular array whose entries represent the pixels of a digitalized image, we consider the problem of reconstructing an image from the number of occurrences of each color in every column and in every row. The complexity of this problem is still open when there are just three colors in the image. We study some special cases where the number of occurrences of each color is limited to small values. Formulations in terms of edge coloring in graphs and as timetabling problems are used; complexity results are derived from the model.     

On disjoint configurations in infinite graphs

For a graph A and a positive integer n, let nA denote the union of n disjoint copies of A; similarly, the union of ?₀ disjoint copies of A is referred to as ?₀A. It is shown that there exist (connected) graphs A and G such that nA is a minor of G for all n??, but ?₀A is not a minor of G. This supplements previous examples showing that analogous statements are true if, instead of minors, isomorphic embeddings or topological minors are considered. The construction of A and G is based on the fact that there exist (infinite) graphs G₁, G₂,… such that G_i is not a minor of G_j for all i ≠ j. In contrast to previous examples concerning isomorphic embeddings and topological minors, the graphs A and G presented here are not locally finite. The following conjecture is suggested: for each locally finite connected graph A and each graph G, if nA is a minor of G for all n ? ?, then ?₀A is a minor of G, too. If true, this would be a far‐reaching generalization of a classical result of R. Halin on families of disjoint one‐way infinite paths in graphs. © 2002 Wiley Periodicals, Inc. J Graph Theory 39: 222–229, 2002; DOI 10.1002/jgt.10016