On the Entropy of Spanning Trees on a Large Triangular Lattice

The double integral representing the entropy S_tri of spanning trees on a large triangular lattice is evaluated using two different methods, one algebraic and one graphical. Both methods lead to the same result

On the Characteristic of Proper Lattice Implication Algebras

ＯｎｔｈｅＣｈａｒａｃｔｅｒｉｓｔｉｃｏｆＰｒｏｐｅｒＬａｔｔｉｃｅＩｍｐｌｉｃａｔｉｏｎＡｌｇｅｂｒａｓ￥ＸｕＹａｎｇ；ＱｉｎＫｅｙｕｎ（ＳｏｕｔｈｗｅｓｔＪｉａｏｔｏｎｇＵｎｉｖｅｒｓｉｔｙ）（ＨｅｎａｎＮｏｒｍａｌＵｎｉｖｅｒｓｉｔｙ）Ａｂｓｔ...     

Erratum: On the Contractions of Vectorial Lattice Representations

An isometric sublattice on a six-dimensional vector space lattice is constructed having a congruence relation such that the factor lattice does not admit any representation via contraction.     

Homotopy of Non-Modular Partitions and the Whitehouse Module

We present a class of subposets of the partition lattice _n with the following property: The order complex is homotopy equivalent to the order complex of _n – 1, and the S _n -module structure of the homology coincides with a recently discovered lifting of the S _n – 1-action on the homology of _n – 1. This is the Whitehouse representation on Robinson's space of fully-grown trees, and has also appeared in work of Getzler and Kapranov, Mathieu, Hanlon and Stanley, and Babson et al.One example is the subposet P _n ⁿ – 1 of the lattice of set partitions _n , obtained by removing all elements with a unique nontrivial block. More generally, for 2 k n – 1, let Q _n ^k denote the subposet of the partition lattice _n obtained by removing all elements with a unique nontrivial block of size equal to k, and let P _n ^k = _{i = 2} ^k Q _n ⁱ . We show that P _n ^k is Cohen-Macaulay, and that P _n ^k and Q _n ^k are both homotopy equivalent to a wedge of spheres of dimension (n – 4), with Betti number . The posets Q _n ^k are neither shellable nor Cohen-Macaulay. We show that the S _n -module structure of the homology generalises the Whitehouse module in a simple way.We also present a short proof of the well-known result that rank-selection in a poset preserves the Cohen-Macaulay property.     

Extension of a Theorem of Kiming and Olsson for the Partition Function

Some congruence properties of the partition function are proved.     

关于格蕴涵代数公理的一个注记

设在一个非空集合L上有一个二元运算→和两个零元运算O与I，除此之外没有其它已知的代数结构，利用这三个运算可以在L上定义一个一元运算′和两个二元运算∨和∧（定义2．1）。本文证明了只要这些运算满足格蕴涵代数的公理（不包括有余格的公理），（L，∨，∧，′）就是一个有泛界O，I的有余格（定理2．2）。因此在定义格蕴涵代数时可以在一个没有任何代数结构的非空集合上定义蕴含运算而不必在一个有泛界的有余格上定义蕴含运算，而且在这两种定义方式中蕴含运算所满足的条件是相同的。     

A Probabilistic Approach to the Problem of the Defects of Admissible Sets in a Lattice

New estimates for the defect of the admissible set in a lattice are obtained for a sufficiently large class of sequences.     

A Formula for Khovanov Typ e Link Homology of Pretzel Knots

Khovanov type homology is a generalization of Khovanov homology. The main result of this paper is to give a recursive formula for Khovanov type homology of pretzel knots P (?n,?m, m). The computations reveal that the rank of the homology of pretzel knots is an invariant of n. The proof is based on a “shortcut” and two lemmas that recursively reduce the computational complexity of Khovanov type homology.     

Relating Subsets of a Poset,and a Partition Theorem for WQOs

We point out some basic properties of the partial ordering which a poset P induces on its power set, defining AB to mean that every element of A lies below some element of B. One result is that if P is a WQO then P decomposes uniquely into finitely many indivisible sets A ₁,...,A _n (that are essential parts of P in the sense that PP\A _i ).     

On the Lattice Approximation for Certain Generalized Vector Markov Fields in Four Spacetime Dimensions

We extend previous results by Albeverio, Iwata and Schmidt on the construction of a convergent lattice approximation for invariant scalar 3-vector generalized random fields F of an infinitely divisible type and apply them to the construction of convergent lattice approximation for the generalized random vector field A determined by the stochastic quaternionic Cauchy–Riemann equation A = F.     

一类(a+1,3)型的距离正则图

设Γ是直径为d且型为(α 1,3)的距离正则图,其中α≥2.用l(c,a,b)表示交叉阵列l(Γ)中列(c,a,b)~t的个数,记r=r(Γ)=l(c_1,a_1,b_1),s=s(Γ)=l(c_(r 1),a(r 1),b_(r 1)).那末,若c_(r 1)=3且a_(r 1)=3a,则d=r s 1,c_d=4且Γ为正则拟2d边形.     

Completeness of the Description of an Equilibrium Canonical Ensemble by a Two-Particle Partition Function

We show that in the equilibrium classical canonical ensemble of particles with pair interaction, the full Gibbs partition function can be uniquely expressed in terms of the two-particle partition function. This implies that for a fixed number N of particles in the equilibrium system and a fixed volume V and temperature T, the two-particle partition function fully describes the Gibbs partition as well as the N-particle system in question. The Gibbs partition can be represented as a power series in the two-particle partition function. As an example, we give the linear term of this expansion. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 145, No. 1, pp. 123–132, October, 2005.     

正整数的一类三分拆的应用

利用正整数n的一类特殊的3分拆n=n1+n2+n3,n1>n2>n3≥1,且n2+n3>n1的Ferrers图将不定方程4x1+3x2+2x3=n(n≥9)的正整数解与这种分拆联系起来,从而得到了该不定方程的正整数解数公式;同时也给出了正整数n的一类4分拆的计数公式.此外,还给出了周长为n的整边三角形的计数公式的一个简单证明.     

Lattice Points Inside Rational Simplices and the Casson Invariant of Brieskorn Spheres

We express the number of lattice points inside certain simplices with vertices in Q³ or Q⁴ in terms of Dedekind–Rademacher sums. This leads to an elementary proof of a formula relating the Euler characteristic of the Seiberg–Witten-Floer homology of a Brieskorn Z-homology sphere to the Casson invariant.     

Minimum Cutsets for an Element of a Subspace Lattice over a Finite Vector Space

Let L_n(q) denote the lattice of subspaces of ann-dimensional vector space over the finite field of q elements, ordered byinclusion. In this note, we prove that for all n and m the minimum cutsetfor an element A with is justL(A) if m < n/ 2, is U(A) if m > n/ 2, and both L(A) andU(A) if m = n/ 2, where L(A) is the collection of all such that and , and U(A) the collection of all such that and . Hence a finite vector space analog isgiven for the theorem of Griggs and Kleitman that determines all the minimumcutsets for an element of a Boolean algebra.     

A Distributive Lattice on the Set of Perfect Matchings of a Plane Bipartite Graph

Let G be a plane bipartite graph and M(G) the set of perfect matchings of G. The Z-transformation graph of G is defined as a graph on M(G): M,MM(G) are joined by an edge if and only if they differ only in one cycle that is the boundary of an inner face of G. A property that a certain orientation of the Z-transformation graph of G is acyclic implies a partially ordered relation on M(G). An equivalent definition of the poset M(G) is discussed in detail. If G is elementary, the following main results are obtained in this article: the poset M(G) is a finite distributive lattice, and its Hasse diagram is isomorphic to the Z-transformation digraph of G. Further, a distributive lattice structure is established on the set of perfect matchings of any plane bipartite graph.     

建材中VOCs扩散系数和分配系数的模型研究

Bodala,运用静态双仓法建立的测定干建材中VOCs扩散系数和分配系数的数学模型是合理的,有一定的应用价值.但该模型假设低浓度仓中VOCs的初始浓度为零,限制了模型的应用范围.针对使用VOCs液体为污染源且建材透气性较好的条件,作出合理的假设,构建了VOCs在建材中扩散的数学模型.采用LaplaceCarson变换详细求解模型,得出计算VOCs扩散系数的方法,并运用两组数据对模型进行了比较分析,结果表明优化后的模型有一定的实用性和可行性.     

Local duality for equitable partitions of a Hamming space

The Hamming space Qn is the set of binary words of length n. A partition (C₁,C₂,…,Cr) of Qn with quotient matrix B=[bij]_r×r is equitable if for all i and j, any word in the cell Ci has exactly bij neighbors in the cell Cj. In this paper, we provide an explicit formula relating the local spectrum of cells in the face to that in the orthogonal face.     

A Multilevel Search Algorithm for the Maximization of Submodular Functions Applied to the Quadratic Cost Partition Problem

Maximization of submodular functions on a ground set is a NP-hard combinatorial optimization problem. Data correcting algorithms are among the several algorithms suggested for solving this problem exactly and approximately. From the point of view of Hasse diagrams data correcting algorithms use information belonging to only one level in the Hasse diagram adjacent to the level of the solution at hand. In this paper, we propose a data correcting algorithm that looks at multiple levels of the Hasse diagram and hence makes the data correcting algorithm more efficient. Our computations with quadratic cost partition problems show that this multilevel search effects a 8- to 10-fold reduction in computation times, so that some of the dense quadratic partition problem instances of size 500, currently considered as some of the most difficult problems and far beyond the capabilities of current exact methods, are solvable on a personal computer working at 300 MHz within 10 min.     

The mod 2 Homology of the General Linear Group of a 2-adic Local Field

Let F be a finite extension of the 2-adic rational numbers. We compute the mod 2 homology of the general linear group GL(F) as a Hopf algebra over the Steenrod algebra. The answer is formulated in terms of the well-known homology algebras of the infinite unitary group U, its classifying space BU, and the classifying space BO of the infinite orthogonal group.