On a proper acute triangulation of a polyhedral surface

Let Σ be a polyhedral surface in R³ with n edges. Let L be the length of the longest edge in Σ, δ be the minimum value of the geodesic distance from a vertex to an edge that is not incident to the vertex, and θ be the measure of the smallest face angle in Σ. We prove that Σ can be triangulated into at most CLn/(δθ) planar and rectilinear acute triangles, where C is an absolute constant.     

On the regularity of the heat equation solution in non-cylindrical domains: Two approaches

In this work, we investigate the behavior of the solution of the Cauchy-Dirichlet problem for a parabolic equation set in a three-dimensional domain with edges. We also give new regularity results for the weak solution of this equation in terms of the regularity of the initial data.     

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.     

On Monomial Reduction and Polynomial Expressions with Respect to Binomial Ideals

Let I ? K[x ₁,…, x _n ] be an ideal and G be the reduced Gröbner basis of I with respect to lexicographic monomial order. We introduce the index of an expression of f ∈ K[x ₁,…, x _n ] with respect to G. A minimal expression is characterized as the one with zero G-index. In case where I is a binomial prime ideal, a new division algorithm with minimal and unique expression is presented. The application of our new method on benchmark polynomial systems cyclic-9 and cyclic-12 shows its superiority in comparison with the existing division algorithm.     

Preface

We are presenting in this volume the collection of extended abstracts of 66 talks that were presented at Combinatorics 2012 in Perugia, Italy. Combinatorics 2012 is the 17th in the series of combinatorics conferences held in Italy, first in 1981, next in 1982 and every two years since then.     

双(环戊二烯基)二氯化锆催化合成乙烯-笼型倍半硅氧烷杂化共聚物及其结构表征

通过双(环戊二烯基)二氯化锆(Cp₂ZrCl₂)催化剂和改良的甲基铝氧烷(MMAO)助催化剂, 合成了无机-有机杂化共聚物. 研究了2种具有不同单乙烯基反应基团的笼型倍半硅氧烷(POSS)与乙烯的聚合. 对共聚产物的结构、 热力学性质、 分子量及其分布等进行了研究. 共聚单体(POSS)的插入率在0.01%~0.30%之间, 随着共聚单体在共聚物中摩尔分数的增大, 聚合物的熔点和熔解热降低. 共聚物的热重分析结果显示, 乙烯-POSS共聚物拥有更高的热分解温度以及较高的热分解残留量. 随着POSS的加入, 聚合物的分子量明显提高, 聚合物的分子量分布变宽.     

Exact solutions of lattice polymer models

We consider directed path models of a selection of polymer and vesicle problems. Each model is used to illustrate an important method of solving lattice path enumeration problems. In particular, the Temperley method is used for the polymer collapse problem. The ZL method is used to solve the semi-continuous vesicle model. The Constant Term method is used to solve a set of partial difference equations for the polymer adsorption problem. The Kernel method is used to solve the functional equation that arises in the polymer force problem. Finally, the Transfer Matrix method is used to solve a problem in colloid dispersions. All these methods are combinatorially similar as they all construct equations by considering the action of adding an additional column to the set of objects.     

Two graph isomorphism polytopes

The convex hull ψ_n,n of certain (n!)² tensors was considered recently in connection with graph isomorphism. We consider the convex hull ψ_n of the n! diagonals among these tensors. We show: 1. The polytope ψ_n is a face of ψ_n,n. 2. Deciding if a graph G has a subgraph isomorphic to H reduces to optimization over ψ_n. 3. Optimization over ψ_n reduces to optimization over ψ_n,n. In particular, this implies that the subgraph isomorphism problem reduces to optimization over ψ_n,n.