Average adjacencies for tetrahedral skeleton-regular partitions

For any conforming mesh, the application of a skeleton-regular partition over each element in the mesh, produces a conforming mesh such that all the topological elements of the same dimension are subdivided into the same number of child-elements. Every skeleton-regular partition has associated special constitutive (recurrence) equations. In this paper the average adjacencies associated with the skeleton-regular partitions in 3D are studied. In three-dimensions different values for the asymptotic number of average adjacencies are obtained depending on the considered partition, in contrast with the two-dimensional case [J. Comput. Appl. Math. 140 (2002) 673]. In addition, a priori formulae for the average asymptotic adjacency relations for any skeleton-regular partition in 3D are provided.     

On rectangular cartograms

A rectangular cartogram is a type of map where every region is a rectangle. The size of the rectangles is chosen such that their areas represent a geographic variable (e.g., population). Good rectangular cartograms are hard to generate: The area specifications for each rectangle may make it impossible to realize correct adjacencies between the regions and so hamper the intuitive understanding of the map.

We present the first algorithms for rectangular cartogram construction. Our algorithms depend on a precise formalization of region adjacencies and build upon existing VLSI layout algorithms. Furthermore, we characterize a non-trivial class of rectangular subdivisions for which exact cartograms can be computed efficiently. An implementation of our algorithms and various tests show that in practice, visually pleasing rectangular cartograms with small cartographic error can be generated effectively.     

Simple Cohen–Macaulay Codimension 2 Singularities

In this article, we provide a complete list of simple isolated Cohen–Macaulay codimension 2 singularities together with a list of adjacencies which is complete in the case of fat point and space curve singularities.     

Line isomorphisms on dipseudographs

Line functions between dipseudographs (directed graphs with loops and multiple lines) that preserve various types of line adjacencies (such as head-to-head or head-to-tail) are characterized.     

When the degree sequence is a sufficient statistic

There is a uniquely defined random graph model with independent adjacencies in which the degree sequence is a sufficient statistic. The model was recently discovered independently by several authors. Here we join to the statistical investigation of the model, proving that if the degree sequence is in the interior of the polytope defined by the Erd?s–Gallai conditions, then a unique maximum likelihood estimate exists.     

Line pseudodigraphs

A new definition of the line digraph is given that reflects all types of arc adjacencies in the original digraph. The definition also allows for loops and multiple arcs, hence it is called the line pseudodigraph. A Whitney type theorem is then given; that is, the relationship between pseudodigraphs having the same line pseudodigraph is determined.     

Restricted words by adjacencies

A recurrence, a determinant formula, and generating functions are presented for enumerating words with restricted letters by adjacencies. The main theorem leads to refinements (with up to two additional parameters) of known results on compositions, polyominoes, and permutations. Among the examples considered are (1) the introduction of the ascent variation on compositions, (2) the enumeration of directed vertically convex polyominoes by upper descents, area, perimeter, relative height, and column number, (3) a tri-variate extension of MacMahon's determinant formula for permutations with prescribed descent set, and (4) a combinatorial setting for an entire sequence of bibasic Bessel functions.     

The knapsack problem with neighbour constraints

We study a constrained version of the knapsack problem in which dependencies between items are given by the adjacencies of a graph. In the 1-neighbour knapsack problem, an item can be selected only if at least one of its neighbours is also selected. In the all-neighbours knapsack problem, an item can be selected only if all its neighbours are also selected.We give approximation algorithms and hardness results when the vertices have both uniform and arbitrary weight and profit functions, and when the dependency graph is directed and undirected.     

On 2-switches and isomorphism classes

A 2-switch is an edge addition/deletion operation that changes adjacencies in the graph while preserving the degree of each vertex. A well-known result states that graphs with the same degree sequence may be changed into each other via sequences of 2-switches. We show that if a 2-switch changes the isomorphism class of a graph, then it must take place in one of four configurations. We also present a sufficient condition for a 2-switch to change the isomorphism class of a graph. As consequences, we give a new characterization of matrogenic graphs and determine the largest hereditary graph family whose members are all the unique realizations (up to isomorphism) of their respective degree sequences.     

Adjacency based method for generating maximal efficient faces in multiobjective linear programming

Multiobjective linear optimization problems (MOLPs) arise when several linear objective functions have to be optimized over a convex polyhedron. In this paper, we propose a new method for generating the entire efficient set for MOLPs in the outcome space. This method is based on the concept of adjacencies between efficient extreme points. It uses a local exploration approach to generate simultaneously efficient extreme points and maximal efficient faces. We therefore define an efficient face as the combination of adjacent efficient extreme points that define its border. We propose to use an iterative simplex pivoting algorithm to find adjacent efficient extreme points. Concurrently, maximal efficient faces are generated by testing relative interior points. The proposed method is constructive such that each extreme point, while searching for incident faces, can transmit some local informations to its adjacent efficient extreme points in order to complete the faces’ construction. The performance of our method is reported and the computational results based on randomly generated MOLPs are discussed.     

On the adjacencies of triangular meshes based on skeleton-regular partitions

For any 2D triangulation τ, the 1-skeleton mesh of τ is the wireframe mesh defined by the edges of τ, while that for any 3D triangulation τ, the 1-skeleton and the 2-skeleton meshes, respectively, correspond to the wireframe mesh formed by the edges of τ and the “surface” mesh defined by the triangular faces of τ. A skeleton-regular partition of a triangle or a tetrahedra, is a partition that globally applied over each element of a conforming mesh (where the intersection of adjacent elements is a vertex or a common face, or a common edge) produce both a refined conforming mesh and refined and conforming skeleton meshes. Such a partition divides all the edges (and all the faces) of an individual element in the same number of edges (faces). We prove that sequences of meshes constructed by applying a skeleton-regular partition over each element of the preceding mesh have an associated set of difference equations which relate the number of elements, faces, edges and vertices of the nth and (n−1)th meshes. By using these constitutive difference equations we prove that asymptotically the average number of adjacencies over these meshes (number of triangles by node and number of tetrahedra by vertex) is constant when n goes to infinity. We relate these results with the non-degeneracy properties of longest-edge based partitions in 2D and include empirical results which support the conjecture that analogous results hold in 3D.     

Galois Graphs: Walks, Trees and Automorphisms

Given a symmetric polynomial (x, y) over a perfect field k of characteristic zero, the Galois graph G() is defined by taking the algebraic closure as the vertex set and adjacencies corresponding to the zeroes of (x, y). Some graph properties of G(), such as lengths of walks, distances and cycles are described in terms of . Symmetry is also considered, relating the Galois group Gal( /k) to the automorphism group of certain classes of Galois graphs. Finally, an application concerning modular curves classifying pairs of isogeny elliptic curves is revisited.     

Geometric graph homomorphisms

A geometric graph is a simple graph drawn on points in the plane, in general position, with straightline edges. A geometric homomorphism from to is a vertex map that preserves adjacencies and crossings. This work proves some basic properties of geometric homomorphisms and defines the geochromatic number as the minimum n so that there is a geometric homomorphism from to a geometric n‐clique. The geochromatic number is related to both the chromatic number and to the minimum number of plane layers of . By providing an infinite family of bipartite geometric graphs, each of which is constructed of two plane layers, which take on all possible values of geochromatic number, we show that these relationships do not determine the geochromatic number. This article also gives necessary (but not sufficient) and sufficient (but not necessary) conditions for a geometric graph to have geochromatic number at most four. As a corollary, we get precise criteria for a bipartite geometric graph to have geochromatic number at most four. This article also gives criteria for a geometric graph to be homomorphic to certain geometric realizations of K_{2, 2} and K_{3, 3}. © 2011 Wiley Periodicals, Inc. J Graph Theory 69:97‐113, 2012     

Efficiently navigating a random Delaunay triangulation

Planar graph navigation is an important problem with significant implications to both point location in geometric data structures and routing in networks. However, whilst a number of algorithms and existence proofs have been proposed, very little analysis is available for the properties of the paths generated and the computational resources required to generate them under a random distribution hypothesis for the input. In this paper we analyse a new deterministic planar navigation algorithm with constant spanning ratio (w.r.t the Euclidean distance) which follows vertex adjacencies in the Delaunay triangulation. We call this strategy cone walk. We prove that given n uniform points in a smooth convex domain of unit area, and for any start point z and query point q; cone walk applied to z and q will access at most sites with complexity with probability tending to 1 as n goes to infinity. We additionally show that in this model, cone walk is ‐memoryless with high probability for any pair of start and query point in the domain, for any positive ξ. We take special care throughout to ensure our bounds are valid even when the query points are arbitrarily close to the border. © 2016 Wiley Periodicals, Inc. Random Struct. Alg., 49, 95–136, 2016     

Tiling Groupoids and Bratteli Diagrams

Let T be an aperiodic and repetitive tiling of ${{\mathbb R}^d}$ with finite local complexity. Let Ω be its tiling space with canonical transversal ${\Xi}$ . The tiling equivalence relation ${R_\Xi}$ is the set of pairs of tilings in ${\Xi}$ which are translates of each others, with a certain (étale) topology. In this paper ${R_\Xi}$ is reconstructed as a generalized “tail equivalence” on a Bratteli diagram, with its standard AF -relation as a subequivalence relation. Using a generalization of the Anderson–Putnam complex (Bellissard et al. in Commun. Math. Phys. 261:1–41, 2006) Ω is identified with the inverse limit of a sequence of finite CW-complexes. A Bratteli diagram ${{\mathcal B}}$ is built from this sequence, and its set of infinite paths ${\partial {\mathcal B}}$ is homeomorphic to ${\Xi}$ . The diagram ${{\mathcal B}}$ is endowed with a horizontal structure: additional edges that encode the adjacencies of patches in T. This allows to define an étale equivalence relation ${R_{\mathcal B}}$ on ${\partial {\mathcal B}}$ which is homeomorphic to ${R_\Xi}$ , and contains the AF-relation of “tail equivalence”.     

Extracting factors for students’ motivation in studying mathematics

The purpose of this article is to identify factors that statistically explain the variation and the measures on the level of motivation of a sample of mathematics students in a university. Specifically, this analysis will identify groups of similar items and reduce the number of variables used in a study. This article explains the use of exploratory factor analysis in extracting factors of personal belief and motivational factors among students in learning mathematics. The adaptation of these factors can be used for assessing academic performance in relation to motivation level. By identifying these factors, the mathematics educators or researchers will be able to find ways to improve the condition of the factors and also to further investigate the factors based on confirmatory approaches.     

复流形上具有非光滑边界的强拟凸域上带权因子的Koppelman-Leray公式

利用权因子,我们得到了复流形上边界不必光滑的强拟凸域上（狆,狇）微分形式的带权因子的Ｋｏｐｐｅｌｍａｎ Ｌｅｒａｙ公式及其 方程的带权因子的解,其特点是不含有边界积分,从而避免了边界积分的复杂估计．其次,引进了权因子,带权因子的积分公式在应用上具有更大的灵活性．     

企业组织变革的影响因素及变革模式实证分析:以新创科技企业为例

利用因子分析法将影响组织变革的指标变量综合简化,甄别主要影响因素;借助于结构方程模型刻画组织变革的影响因素对于组织变革过程以及组织绩效的影响程度,验证了组织变革动力因素中组织内部因素作用大于外部因素的假设,指出充分利用变革的动力因素比极力排斥阻力因素的组织绩效更高,从而形成基于创新的,强调组织知识和结构创新的新创科技企业组织变革模式。     

基于Panel Data的中国农业发展因素的实证分析

本文利用1998-2004年我国29个省的面板数据,将农业生产的投入要素区分为物质性投入要素和非物质性投入要素,分别建立了中性技术和非中性技术条件下的C-D生产函数和扩展的C-D生产函数模型,对影响我国农业发展的因素进行了实证分析,并依据分析结果,对促进我国农业发展提出了政策建议.