The aim of this paper is to present algebraic method which is called Wu's method to solving fuzzy complex systems of linear equations. Wu's method is used as a solution procedure for solving the crisp polynomial equations system. This algorithm leads to solving characteristic sets that are amenable to easy solution. To illustrate the easy application of the proposed method, numerical examples a...

We generalise the definition of the characteristic of an integral triangle to integral sim-plices and prove that each simplex in an integral point set has the same characteristic. This theorem is used for an efficient construction algorithm for integral point sets. Using this algorithm we are able to provide new exact values for the minimum diameter of integral point sets.

We present a semi-automated framework for constructing factoid question answering (QA) datasets, where an array of question characteristics are formalized, including structure complexity, function, commonness, answer cardinality, and paraphrasing. Instead of collecting questions and manually characterizing them, we employ a reverse procedure, first generating a kind of graph-structured logical ...

We give upper bounds for the order of the elements in a characteristic set of a regular differential ideal or a radical of a finitely generated differential ideal with respect to some specific orderings. We then show how to compute characteristic sets of these ideals using algebraic methods. 2000 Mathematics Subject Classification: 12H05, 13B25, 13P10.

Significant values of a combinatorial count need not fit the recurrence for the count. Consequently, initial values of the count can much outnumber those for the recurrence. So is the case of the count, Gl(n), of distance-l independent sets on the cycle Cn, studied by Comtet for l ≥ 0 and n ≥ 1 [sic]. We prove that values of Gl(n) are nth power sums of the characteristic roots of the correspond...

Ritt-Wu’s algorithm of characteristic sets is the most representative for triangularizing sets of multivariate polynomials. Pseudo-division is the main operation used in this algorithm. In this paper we present a new algorithmic scheme for computing generalized characteristic sets by introducing other admissible reductions than pseudo-division. A concrete subalgorithm is designed to triangulari...

We present in this paper two dequantization procedures of coadjoint orbits in the setting of exponential solvable Lie groups. The first one consists in considering generalized moment sets of unitary representations. The second one concerns characteristic and Poisson characteristic varieties of some topological unitary modules over a deformed algebra appropriately associated with a given represe...