On a combinatorial problem in varieties of groups - Endimioni - 1995 () Citation Context ...e locally finite or locally soluble group in V(w ∗ ) belongs to the variety V(w), where w is a word in a free group such that finitely generated soluble groups in V(w) are nilpotent (...
For more than 250 years combinatorial problems on chessboards have been studied and published in numerous books on recreational mathematics. Two problems of this type include the problem of finding a placement of n non-attacking queens on an n×n chessboard and the problem of determining the mini...
华中科技大学 Huazhong University of Science and Technology A combinatorial Yamabe problem on two and three dimensional manifolds 讲座论坛 0 2016-04-30 16:00 科技楼南楼702 主讲人 徐旭 主讲人介绍 华科数学2006年本科毕业,2011年中科院博士毕业
Motivated by an application in the automobile industry, we present results and conjectures on a new combinatorial problem: Given a word w and restricted reservoirs of colored letters, synthesize w with a minimal number of color changes. We present a dynamic program that solves this problem and ru...
A unified framework for solving any combinatorial optimization problem over graphs:使用边到顶点的线图(line graph),对涉及节点和边上的动作的问题进行建模,将图算法建模为一个single player game,通过改变目标或奖励函数来学习不同的问题。 Unified Framework 对于一个图 G=(V,E,W), V={1,...,n} 为节点...
The Traveling Salesman Problem and the Vehicle Routing Problem are two of the most popular problems in the field of combinatorial optimization. The purpose of this paper is to show how their study has fostered the development of some of the most popular algorithms now applied to the solution of...
讲座论坛简介 In this talk we will introduce a new definition of discrete curvature on two and three dimensional triangulated manifolds, which is a modification of the well-known discrete curvature on these manifolds.The new definition is more natural and respects the scaling exactly the same way ...
There are several types of scheduling anomalies (Andersson and Jonsson, 2002) that make the determination of the worst sequence of arrivals a combinatorial problem. Schedulability analysis for multiprocessors usually produces very pessimistic upper bounds on task response times. Consequently, such analysis...
We present applications to uniform boundedness of torsion of rank two Drinfeld modules that improve upon existing results, and to lower bounds on the modular degree of certain elliptic curves over function fields that solve a problem of Papikian. 展开 关键词:...
Thus, the problem of factoring is reduced to a combinatorial optimization problem. Such problems can be solved using quantum computers by associating a qubit with each bit in the cost function. The number of qubits needed depends on the number of bits in the clauses. As discussed in9, some...