关于方程a~x b~y=c~z的Terai-Jemanowicz猜想

设ｍ是正整数,证明了：（Ａ）如果ｂ是奇素数,且ａ＝ｍ３－３ｍ,ｂ＝３ｍ２－１,ｃ＝ｍ２＋１, 那么丢番图方程 ａｘ＋ ｂｙ＝ｃｚ（１）仅有正整数解（ｘ,ｙ,ｚ）＝（２,２,３）;（Ｂ）如果ｂ是奇素数,且 ａ＝ｍ｜ｍ４－１０ｍ２＋５｜,ｂ＝５ｍ４－１０ｍ２＋５｜,ｂ＝ ５ｍ４－１０ｍ２＋１, ｃ＝ｍ２＋ １,那么丢番图方程（１）仅有正整数解 （ｘ,ｙ,ｚ）＝（２,２,５）．     

Cayley图的边Hamilton性

设Ｘ是有限群Ｇ的一个生成集．Ｃａｙ（Ｘ：Ｇ）表示生成集为Ｘ的Ｇ上的Ｃａｒｌｅｙ图，其顶点集为Ｇ，其边集为所有无序对［ａ，ｂ］组成的集合，其中ａ，ｂ∈Ｇ，ａ－１ｂ∈Ｘ∪Ｘ－１（Ｘ－１＝｛ｘ－１｜ｘ∈Ｘ｝）．若图的每条边都在的Ｈａｍｉｌｔｏｎ圈上，则称图是边－Ｈａｍｉｌｔｏｎ图．本文证明了：当Ｇ为ｐ－群或Ｈａｍｉｌｔｏｎ群时，若Ｘ含有Ｇ的中心元，则Ｃａｙ（Ｘ：Ｇ）是边－Ｈａｍｉｌｔｏｎ图．     

初二上期数学期末检测题

一、填空题（每小题２分,共１０分）１．分解因式：２ｘ２－１３２＝．２．计算：ａｘ－ｙ－ａｙ－ｘ＝．３．当ｘ时,分式５ｘｘ－１有意义．４．若３ｘ＋４ｍ＝５,则ｍ＝．５．如果ａ２＋ｂ２－２ａ－４ｂ＋５＝０,则２－２ｂ＝．二、选择题（每小题３分,共９分）１．下列各式中,计算正确的有（　）．①ａｂ＝ａｍｂｍ　②－５ｂ－６ａ＝－５ｂ６ａ③（－２ｘｙ）２＝２ｘ２ｙ２　④（ａ－ｂ）２＝（ｂ－ａ）２（Ａ）１个　（Ｂ）２个　（Ｃ）３个　（Ｄ）４个２．在公式Ｓ＝１２（ａ＋ｂ）ｈ,已知Ｓ、ｂ、ｈ,则ａ＝（　）．（Ａ）…     

代数初步知识目标检测

一、判断题（１６分）１．ｃ不是代数式．（　）２．２ａ－３＝４－ａ不是方程．（　）３．３４不是方程（ｘ－１２）３＝１６４的解．（　）４．ｂ表示任意整数,ｂ的倒数就是１ｂ．（　）５．ｙ的平方与３ｘ的平方差是ｙ２－３ｘ２．（　）６．代数式９ｘ２的值一定大于零．（　）７．十位上的数是ａ,个位上的数是ｂ的两位数可用代数式记作ａｂ．（　）８．方程ｘ－２＝７的解是ｘ＝５．（　）二、填空（２４分）１．正方体的棱长是ａｃｍ,它的表面积是,它的体积是．２．梯形上底ａ＝５ｃｍ,下底ｂ＝１０ｃｍ,它的面积Ｓ＝６０ｃｍ２…     

与任意图(m,r)-正交的(g,f)-因子分解

设ｇ和ｆ是定义在图Ｇ的顶点集Ｖ（Ｇ）上的整值函数．证明了如下结果：设ｒ是一个正整数,Ｇ是一个（ｍｇ＋（ｍ－１）ｒ,ｍｆ－（ｍ－１）ｒ）－图,且ｇ（ｘ）≥—１,对ｘ∈Ｖ（Ｇ）．则 Ｇ是一个随机（ｍ,ｒ）－正交的（ｇ,ｆ）－可因子化图．     

整式目标测试题(二)

１．填空（每空３分）（１）单项式－ｘｙ５的系数是,次数是．（２）并且的项,是同类项．（３）３ｘｎ－（ｍ－１）ｘ＋１为三次二项式,则－ｍ＋ｎ２＝．（４）５ｘ＋３ｘ２－４ｙ２＝５ｘ－（　）．（５）２ｘ２ｙ３－３ｘ３ｙ＋８ｘ５ｙ１０是次项式．（６）若ｘ＋ｙ＝１２,则３［２ｘ－（ｘ－ｙ）］－（ｘ＋ｙ）的值为．（７）三个连续奇数,中间一个为ｎ,则这三个连续奇数的和为．２．选择题（每题４分）（１）在代数式ｘ２,－ａ２ｂｃ,ａ＋ｂ,－２,－ｙ,－１４ｘ２－３ｙ,ｍ２－ｎ２,ｘｙ１００中,单项式的个数为（　）…     

一元一次方程目标检测题(二)

一、填空题１．某数的１２比它的３倍小４,则这个数为．２．当ｘ＝时,代数式ｘ－１与２ｘ－１４相等．３．单项式３ａ２＋ｘｂ４与－１２ａ５ｂ２（ｙ－３）是同类项,则ｘ＝,ｙ＝．４．在公式Ｓ＝１２（ａ＋ｂ）ｈ中,Ｓ＝１２０,ｈ＝１５且ｂ＝２ａ,则ａ＝．５．填出解方程０．１－０．２ｘ０．３＝１－０．０１ｘ－０．０２０．０６各步的依据：解　１－２ｘ３＝１－ｘ－２６（　　）２（１－２ｘ）＝６－（ｘ－２）（　　）２－４ｘ＝６－ｘ＋２（　　）－４ｘ＋ｘ＝６＋２－２（　　）－３ｘ＝６（　　）ｘ＝－２（　　）６．三个…     

图中含有D—闭迹的一个充分条件

设Ｇ是一个简单图，Ｌ＝ｕ１ｕ２…ｕｔ是Ｇ中的一个路，定义Ｌ的度ｄ（Ｌ）＝∑ｔｉ＝１ｄ（ｕｉ），其中ｄ（ｕｉ）为ｕｉ在Ｇ中的度数．本文证明了：若Ｇ是ｎ≥３阶几乎无桥的简单连通图，ＧＫ１，ｎ－１，且对Ｇ中任何两个无公共点的二长路Ｌ１，Ｌ２，有ｄ（Ｌ１）＋ｄ（Ｌ２）≥２ｎ－１，则Ｇ有一个Ｄ－闭迹，从而Ｇ的线图Ｌ（Ｇ）是Ｈａｍｉｌｔｏｎ图．     

分式目标检测题(A)

一、判断题（每小题２分,共１０分）１．含有分母的代数式是分式．（　）２．整式和分式统称有理式．（　）３．ａ２－ｂ２ａ＋ｂ＝ａ２－ｂ２÷ａ＋ｂ．（　）４．－ａｂ＝ａ－ｂ＝－ａｂ．（　）５．当ａ≠０时,方程ａｘ－ｂ＝０的解是ｘ＝ｂａ．（　）二、填空题（每小题２分,共２０分）１．有理式－ａ２,１ｘ,－２ｘ３,ｎ－１３ｍ,１ｘ－２ｙ中,属于分式的有个．２．当ｘ＝时,分式ｘ－３２ｘ＋１的值为零,当ｘ时,分式ｘ２ｘ－３有意义．３．（１）ｙｘ＝（　　）ｘ２,（２）ｃ２ａｂ＝ｃ２（　　）（ｃ≠０）４．使分式２３…     

数学问题解答

数学问题解答１９９５年６月号问题解答（解答由问题提供人给出）９５６设实数ｘ，ｙ，ｚ满足求３ｘ＋４ｙ＋５ｚ的范围．解设ｘ＋２ｙ＋３ｚ＝ａ（１）２ｘ＋３ｙ＋４ｚ＝ｂ（２）则．解由（１），（２）组成的方程组得：ｘ＝ｚ＋２ｂ－３ａ，ｙ＝２ａ－ｂ－２ｚ．则：３...     

四正则图的分离问题是NP-完备的

本 文证明了 四正则图 的最小平 分问题是 Ｎ Ｐ完备的 ,因而可得 到四正 则图的最 小 α分离问 题也是 Ｎ Ｐ完备 的     

A natural graph of finite fields distinguishing between models

We define a graph structure associated in a natural way to finite fields that nevertheless distinguishes between different models of isomorphic fields. Certain basic notions in finite field theory have interpretations in terms of standard graph properties. We show that the graphs are connected and provide an estimate of their diameter. An accidental graph isomorphism is uncovered and proved. The smallest non-trivial Laplace eigenvalue is given some attention, in particular for a specific family of 8-regular graphs showing that it is not an expander. We introduce a regular covering graph and show that it is connected if and only if the root is primitive.     

Graphs and recursively defined towers of function fields

In this paper we state and explore a connection between graph theory and the theory of recursively defined towers. This leads, among other things, to a generalization of Lenstra's identity (Finite Fields Appl. 8 (2001) 166) and the solution of an open problem concerning the Deuring polynomial posed in (J. Reine Angew. Math. 557 (2003) 53). Further we investigate the effect extension of the constant field has on the limit of certain towers.     

Minimum node covers and 2-bicritical graphs

The problem of finding a minimum cardinality set of nodes in a graph which meet every edge is of considerable theoretical as well as practical interest. Because of the difficulty of this problem, a linear relaxation of an integer programming model is sometimes used as a heuristic. In fact Nemhauser and Trotter showed that any variables which receive integer values in an optimal solution to the relaxation can retain the same values in an optimal solution to the integer program. We define 2-bicritical graphs and give several characterizations of them. One characterization is that they are precisely the graphs for which an optimal solution to the linear relaxation will have no integer valued variables. Then we show that almost all graphs are 2-bicritical and hence the linear relaxation almost never helps for large random graphs.This research was supported in part by the National Research Council of Canada.     

Eigenvalue estimates of the p-Laplacian on finite graphs

In this paper, we study the eigenvalue of p-Laplacian on finite graphs. Under generalized curvature dimensional condition, we obtain a lower bound of the first nonzero eigenvalue of p-Laplacian. Moreover, a upper bound of the largest p-Laplacian eigenvalue is derived.     

Generating random graphs in biased Maker‐Breaker games

We present a general approach connecting biased Maker‐Breaker games and problems about local resilience in random graphs. We utilize this approach to prove new results and also to derive some known results about biased Maker‐Breaker games. In particular, we show that for , Maker can build a pancyclic graph (that is, a graph that contains cycles of every possible length) while playing a game on . As another application, we show that for , playing a game on , Maker can build a graph which contains copies of all spanning trees having maximum degree with a bare path of linear length (a bare path in a tree T is a path with all interior vertices of degree exactly two in T). © 2015 Wiley Periodicals, Inc. Random Struct. Alg., 47, 615–634, 2015     

On covering expander graphs by hamilton cycles

The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum degree Δ satisfies some basic expansion properties and contains a family of edge disjoint Hamilton cycles, then there also exists a covering of its edges by Hamilton cycles. This implies that for every α > 0 and every there exists a covering of all edges of G(n,p) by Hamilton cycles asymptotically almost surely, which is nearly optimal.Copyright © 2012 Wiley Periodicals, Inc. Random Struct. Alg., 44, 183‐200, 2014     

A useful transform of standard input data for a classical NP-complete problem

The archetypal symmetric travelling salesman problem can be seen in a new and interesting way, by using first a standard preparatory phase of input data, and then by applying a transform from the set D of ‘distances’ among ‘cities’ and the set B of ‘loss of optimality’.The specific form of D→B transform is introduced and discussed. In order to show in realistic terms the interest of the approach proposed, a class of ‘diffusive’ heuristic procedures operating from B is defined.An example of solution by an algorithm included in this class is completely worked out; an outline of computational tests done on the same algorithm is also given.     

Perfect dodecagon quadrangle systems

A dodecagon quadrangle is the graph consisting of two cycles: a 12-cycle (x₁,x₂,…,x₁₂) and a 4-cycle (x₁,x₄,x₇,x₁₀). A dodecagon quadrangle system of order n and index ρ [ DQS] is a pair (X,H), where X is a finite set of n vertices and H is a collection of edge disjoint dodecagon quadrangles (called blocks) which partitions the edge set of ρK_n, with vertex set X. A dodecagon quadrangle system of order n is said to be perfect [PDQS] if the collection of 4-cycles contained in the dodecagon quadrangles form a 4-cycle system of order n and index μ. In this paper we determine completely the spectrum of DQSs of index one and of PDQSs with the inside 4-cycle system of index one.