A Combinatorial Proof of Bass's Evaluations of the Ihara-Selberg Zeta Function for Graphs

We derive combinatorial proofs of the main two evaluations of the Ihara-Selberg zeta function associated with a graph. We give three proofs of the first evaluation all based on the algebra of Lyndon words. In the third proof it is shown that the first evaluation is an immediate consequence of Amitsur's identity on the characteristic polynomial of a sum of matrices. The second evaluation of the Ihara-Selberg zeta function is first derived by means of a sign-changing involution technique. Our second approach makes use of a short matrix-algebra argument.

     

Stability diagram of rice starch as determined with FTIR

Abstract

In this study, we followed in situ changes in the infrared spectrum at different conditions of pressure and temperature. Cooperative changes were observed when temperature or pressure was increased. Plotting the midpoints of cooperative transitions in a pressure-temperature plane results in an outline similar to the stability curve of proteins. We can assume that it is the first time that the pressure-temperature dependent gelation diagram is determined in situ for starch.     

Electrical Properties of Silver Photodoped Amorphous Red Phosphorus

Abstract

Effects of photodoping and thermal doping of silver into sputtered amorphous red phosphorus films (a-P_red) on the electrical properties are studied. The d. c. efectrical conductivity of the photodoped a-p_red at room temperature is about 1×10^?5 Scm^?1 which is a very high value comparing with that of the undoped a-p_red (1×10^?14 Scm^?1). The activation energy for the conduction of the photodoped a-P_red is lower than that of the a-p^red. In contrast, the activation energy of the thermally doped a-p_red is essentially the same as that of the undoped a-p_red. SEM-EDX analyses show that colloidal silver was deposited in the thermally doped a-p_red but not in the photodoped a-p_red. It seems that the photo-doping involves the ionization process of silver by illumination, i.e., Ag^o → Ag⁺ + e^?.     

Preparation and biological evaluation of key fragments and open analogs of scleritodermin A

The synthesis of key fragments of scleritodermin A, their assembly, and their biological evaluation as cytotoxic and anthelmintic were performed. Highlights of the synthetic route include formation of the α-ketoamide linkage and use of stereocontrolled reactions. Open analogs of this natural product were obtained using a convergent strategy.     

On minimal Sturmian partial words

Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A_?=A∪{?}, where ? stands for a hole and matches (or is compatible with) every letter in A. The subword complexity of a partial word w, denoted by p_w(n), is the number of distinct full words (those without holes) over the alphabet that are compatible with factors of length n of w. A function f:N→N is (k,h)-feasible if for each integer N≥1, there exists a k-ary partial word w with h holes such that p_w(n)=f(n) for all n such that 1≤n≤N. We show that when dealing with feasibility in the context of finite binary partial words, the only affine functions that need investigation are f(n)=n+1 and f(n)=2n. It turns out that both are (2,h)-feasible for all non-negative integers h. We classify all minimal partial words with h holes of order N with respect to f(n)=n+1, called Sturmian, computing their lengths as well as their numbers, except when h=0 in which case we describe an algorithm that generates all minimal Sturmian full words. We show that up to reversal and complement, any minimal Sturmian partial word with one hole is of the form aⁱ?a^jba^l, where i,j,l are integers satisfying some restrictions, that all minimal Sturmian partial words with two holes are one-periodic, and that up to complement, ?(a^N−1?)^h−1 is the only minimal Sturmian partial word with h≥3 holes. Finally, we give upper bounds on the lengths of minimal partial words with respect to f(n)=2n, showing them tight for h=0,1 or 2.     

复杂可修复系统故障数据分析处理中的两个问题

马良河等．复杂可修复系统故障数据分析处理中的两个问题．数理统计与管理，１９９８，１７（３），３７～４０．本文给出了利用部件的故障数据对复杂可修复系统的可靠性状态进行分析和估计时应首先解决的两个问题：应选取合适的故障数据及应分析系统部件的固有属性对故障数据的影响。进而给出了这两个问题的解决方法及对系统性能的分析方法。最后针对飞机发动机的一组故障数据给出了计算实例。所用工具主要是假设检验和方差分析的理论     

Testing primitivity on partial words

Primitive words, or strings over a finite alphabet that cannot be written as a power of another string, play an important role in numerous research areas including formal language theory, coding theory, and combinatorics on words. Testing whether or not a word is primitive can be done in linear time in the length of the word. Indeed, a word is primitive if and only if it is not an inside factor of its square. In this paper, we describe a linear time algorithm to test primitivity on partial words which are strings that may contain a number of “do not know” symbols. Our algorithm is based on the combinatorial result that under some condition, a partial word is primitive if and only if it is not compatible with an inside factor of its square. The concept of special, related to commutativity on partial words, is foundational in the design of our algorithm. A World Wide Web server interface at http://www.uncg.edu/mat/primitive/ has been established for automated use of the program.     

Signed words and permutations, I: A fundamental transformation

The statistics major index and inversion number, usually defined on ordinary words, have their counterparts in signed words, namely the so-called flag-major index and flag-inversion number. We give the construction of a new transformation on those signed words that maps the former statistic onto the latter one. It is proved that the transformation also preserves two other set-statistics: the inverse ligne of route and the lower records.

     

群S4对称自治系统的Hopf分支

本文利用Ｌｙａｐｕｎｏｖ－Ｓｃｈｍｉｄｔ方法对一类群Ｓ４对称的自治系统进行讨论,得到了Ｈｏｐｆ分支解的存在条件,研究了分支解的结构。     

A complexity measure approach based on forbidden patterns and correlation degree

Based on forbidden patterns in symbolic dynamics, symbolic subsequences are classified and relations between forbidden patterns, correlation dimensions and complexity measures are studied. A complexity measure approach is proposed in order to separate deterministic (usually chaotic) series from random ones and measure the complexities of different dynamic systems. The complexity is related to the correlation dimensions, and the algorithm is simple and suitable for time series with noise. In the paper, the complexity measure method is used to study dynamic systems of the Logistic map and the H\'enon map with multi-parameters.