The authors give several new criteria to judge whether a simple convex polytope in Euclidean space is combinatorially equivalent product of simplices. These are mixtures combinatorial, geometrical and topological conditions that inspired by the ideas from toric topology In addition, they shorter proof well known criterion on this subject.

We present a concise semidefinite formulation for the problem of minimizing a polynomial over a semi-algebraic set defined by polynomial equalities and inequalities. When the polynomial equalities define a radical ideal I with a finite variety, this representation involves combinatorial moment matrices, indexed by a basis of R[x1, . . . , xn]/I. The arguments are elementary and extend known fac...

Abstrad. By u~ of the Gordan-Stiemke Theorem of the alternative we demonstrate the similarity of four theorems in combinatorial matrix theory. Each theorem contains five equivalent conditions, one of which is the existence in a given pattern of a line-sum-symmetric or constant-line-sum matrix which is semi-positive or strictly positive for the pattern. A generalization of the Gordan-Stiemke The...

This paper proposes some material towards a theory of general toric varieties without the assumption of normality. Their combinatorial description involves a fan to which is attached a set of semigroups subjected to gluing-up conditions. In particular it contains a combinatorial construction of the blowing up of a sheaf of monomial ideals on a toric variety. In the second part this is used to s...

Combinatorial optimization is often with the local extreme point in large numbers. It is usually discontinuous, multidimensional, non-differentiable, constraint conditions, highly nonlinear NP problem. In this paper, according to the characteristics of combinatorial optimization problem, we put forward the combination optimization of multi-agent differential evolution algorithm (COMADE) through...

This paper presents an investigation on the computational complexity of stochastic optimization problems. We discuss a scenariobased model which captures the important classes of two-stage stochastic combinatorial optimization, two-stage stochastic linear programming, and two-stage stochastic integer linear programming. This model can also be used to handle chance constraints, which are used in...

The paper presents a general-purpose algorithm for solving stochastic combinatorial optimization problems with the expected value of a random variable as objective and deterministic constraints. The algorithm follows the Ant Colony Optimization (ACO) approach and uses Monte-Carlo sampling for estimating the objective. It is shown that on rather mild conditions, including that of linear incremen...

This paper proposes some material towards a theory of general toric varieties without the assumption of normality. Their combinatorial description involves a fan to which is attached a set of semigroups subjected to gluing-up conditions. In particular it contains a combinatorial construction of the blowing up of a sheaf of monomial ideals on a toric variety. In the second part this is used to s...

Publications: Parallel Thinning Algorithms Based on Ronse's Sufficient Conditions for Topology Preservation [7], Németh, Gábor [8], and Palágyi Kálmán [9] , Progress in Combinatorial Image Analysis, May 2010, Singapore, p.183 194, (2010) An order-independent sequential thinning algorithm [10], Kardos, Péter [11], Németh Gábor [12], and Palágyi Kálmán [9] , Proceedings of the International Works...

types of combinatorial libraries, such as random shuffling libraries and artificial alternative splicing libraries. The block shuffling and random point mutations can be introduced simultaneously by performing RMPCR under error-prone conditions. Most of the block sequences in the combinatorial libraries created by RM-PCR encode a long open reading frame and are suitable for protein selection ex...