从审计准则角度看注册会计师的民事责任

分析了独立审计准则中的“真实性”概念与法律意义上的“真实性”之间的区别，探讨了独立审计准则中的“职业谨慎”与民法上的“过失(过错)”之间的关系，得出独立审计准则中的“真实性”与民法上的“过错”相对应，只要注册会计师遵循准则，保持合理的职业谨慎，就不会发生重大过失，避免承担民事责任。     

An upper bound on the independence number of benzenoid systems

Recently, the graph theoretic independence number has been linked to fullerene stability [S. Fajtlowicz, C. Larson, Graph-theoretic independence as a predictor of fullerene stability, Chem. Phys. Lett. 377 (2003) 485-490; S. Fajtlowicz, Fullerene Expanders, A list of Conjectures of Minuteman, Available from S. Fajtlowicz: math0@bayou.uh.edu]. In particular, stable fullerenes seem to minimize their independence numbers. A large piece of evidence for this hypothesis comes from the fact that stable benzenoids—close relatives of fullerenes—do minimize their independence numbers [S. Fajtlowicz, “Pony Express”—Graffiti's conjectures about carcinogenic and stable benzenoids, 〈http://www.math.uh.edu/∼siemion/pony.html〉]. In this paper, an upper bound on the independence number of benzenoids is introduced and proven—giving a limit on how large the independence ratio for benzenoids can be. In conclusion, this bound on independence is correlated to an upper bound on the number of unpaired sites a benzenoid system has with respect to a maximum matching, which is precisely the number of zero eigenvalues in the spectrum of the adjacency matrix (due to a conjecture of Graffiti and its proof by Sachs [S. Fajtlowicz, “Pony Express”—Graffiti's conjectures about carcinogenic and stable benzenoids, 〈http://www.math.uh.edu/∼siemion/pony.html〉; H. Sachs, P. John, S. Fajtlowicz, On Maximum Matchings and Eigenvalues of Benzenoid Graphs, preprint—MATCH]). Thus, since zero eigenvalues and unpaired sites are indicative of instability (reactivity), we get a simple but intuitive bound on how reactive a benzenoid molecule can be.     

在Δ≤3的图中上独立数和上无赘数的关系

G（V，E）是一个图。β，IR分别是图G的独立数，上无赘数。这篇文章证明文章［6］中提出的一个猜想.     

Cubicity of threshold graphs

We show that the cubicity of a connected threshold graph is equal to ⌈log₂α⌉, where α is its independence number.     

Independence of of monodromy groups

Let be a smooth curve over a finite field of characteristic , let be a number field, and let be an -compatible system of lisse sheaves on the curve . For each place of not lying over , the -component of the system is a lisse -sheaf on , whose associated arithmetic monodromy group is an algebraic group over the local field . We use Serre's theory of Frobenius tori and Lafforgue's proof of Deligne's conjecture to show that when the -compatible system is semisimple and pure of some integer weight, the isomorphism type of the identity component of these monodromy groups is ``independent of '. More precisely, after replacing by a finite extension, there exists a connected split reductive algebraic group over the number field such that for every place of not lying over , the identity component of the arithmetic monodromy group of is isomorphic to the group with coefficients extended to the local field .

     

Independence and atoms

We prove that if the range of a probability measure contains an interval , 0$">, then there are infinitely many (nontrivial) independent events in this probability space.

     

Asymptotic Upper Bounds for Ramsey Functions

 We show that for any graph G with N vertices and average degree d, if the average degree of any neighborhood induced subgraph is at most a, then the independence number of G is at least Nf _{a +1}(d), where f _{a +1}(d)=∫₀ ¹(((1−t)^{1/( a +1)})/(a+1+(d−a−1)t))dt. Based on this result, we prove that for any fixed k and l, there holds r(K _k + _l ,K _n )≤ (l+o(1))n ^k /(logn) ^{k −1}. In particular, r(K _k , K _n )≤(1+o(1))n ^{k −1}/(log n) ^{k −2}. Received: May 11, 1998 Final version received: March 24, 1999     

Log-concavity of some independence polynomials via a partial ordering

Schwenk proved in 1981 that the edge independence polynomial of a graph is unimodal. It has been known since 1987 that the (vertex) independence polynomial of a graph need not be unimodal. Alavi et al. have asked whether the independence polynomial of a tree is unimodal. We apply some results on the log-concavity of combinations of log-concave sequences toward establishing the log-concavity (and, thus, the unimodality) of the independence numbers of some families of trees and related graphs.