Related papers: A Group-Pertmutation Algorithm to Solve the Genera…
The main goal of this paper is to generalize Jacobi and Gauss-Seidel methods for solving non-square linear system. Towards this goal, we present iterative procedures to obtain an approximate solution for non-square linear system. We derive…
The method, proposed in the given work, allows the application of well developed standard methods used in quantum mechanics for approximate solution of the systems of ordinary linear differential equations with periodical coefficients.
The $d$-Simultaneous Conjugacy problem in the symmetric group $S_n$ asks whether there exists a permutation $\tau \in S_n$ such that $b_j = \tau^{-1}a_j \tau$ holds for all $j = 1,2,\ldots, d$, where $a_1, a_2,\ldots , a_d$ and $b_1,…
We propose a scheme or procedure for doing practical calculations with generalized seniority. It reduces the total computing time by calculating and storing in advance a set of intermediate quantities, taking advantage of the memory…
This article explains the way in which, with the help of Action Script 3 in combination with Flash, a method of solving Sudoku game was implemented, through searching for the certain numbers and after that trying to guess for the squares…
In this paper we present a matricial result that generalizes Hironaka's game and Perron transforms simultaneously. We also show how one can deduce the various forms in which the algorithm of Perron appears in proofs of local uniformization…
We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of transformations and generalizations of…
A combinatorial methods are used to investigate some properties of certain generalized Stirling numbers, including explicit formula and recurrence relations. Furthermore, an expression of these numbers with symmetric function is deduced.
A polynomial algorithm is obtained for the NP-complete linear ordering problem.
We discuss the question of how to pick a matrix uniformly (in an appropriate sense) at random from groups big and small. We give algorithms in some cases, and indicate interesting problems in others.
In this paper we give a mathematical model for a game that we call picture cube puzzle and investigate its properties. The central question is the number of moves required to solve the puzzle. A mathematical discussion is followed by the…
The rules of Sudoku are often specified using twenty seven \texttt{all\_different} constraints, referred to as the {\em big} \mrules. Using graphical proofs and exploratory logic programming, the following main and new result is obtained:…
We present a detailed description of the generalized geometric cluster algorithm for the efficient simulation of continuum fluids. The connection with well-known cluster algorithms for lattice spin models is discussed, and an explicit full…
We propose a semiclassical version of Shor's quantum algorithm to factorize integer numbers, based on spin-1/2 SU(2) generalized coherent states. Surprisingly, we find evidences that the algorithm's success probability is not too severely…
We present new algorithms to classify all string C-group representations of a given group $G$. We use these algorithms to classify all string C-group representations of the sporadic groups of Suzuki and Rudvalis.
In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden normal subgroups of solvable groups and permutation groups,…
We introduce an algorithm to solve linear inverse problems regularized with the total (gradient) variation in a gridless manner. Contrary to most existing methods, that produce an approximate solution which is piecewise constant on a fixed…
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
We propose a quantum algorithm to solve systems of nonlinear algebraic equations. In the ideal case the complexity of the algorithm is linear in the number of variables $n$, which means our algorithm's complexity is less than $O(n^{3})$ of…
We propose a new algorithm solving the extended gcd problem, which provides a solution minimizing one of the two coordinates. The algorithm relies on elementary arithmetic properties.