Related papers: A solution of an equivalence problem for semisimpl…
An efficient numerical algorithm for the computation of linking number is presented. The algorithm keep tracks or rounding error so that it can ensure the correctness of the results.
Quantum synchronizable codes are kinds of quantum error-correcting codes that can not only correct the effects of quantum noise on qubits but also the misalignment in block synchronization. In this paper, the quantum synchronizable codes…
We discuss the last version as well as applications of a method for obtaining exact solutions of nonlinear partial differential equations. As this version is based on more than one simple equation we call it Simple Equations Method (SEsM).…
In this paper, cyclic codes are established over some finite quaternion integer rings with respect to the quaternion Mannheim distance, and de- coding algorithm for these codes is given.
We prove the existence of a positive solution to a semipositone $N$-Laplacian problem with a critical Trudinger-Moser nonlinearity. The proof is based on obtaining uniform $C^{1,\alpha}$ a priori estimates via a compactness argument. Our…
We present an interleaving scheme that yields quasi-cyclic turbo codes. We prove that randomly chosen members of this family yield with probability almost 1 turbo codes with asymptotically optimum minimum distance, i.e. growing as a…
The complexity-performance trade-off is a fundamental aspect of the design of low-density parity-check (LDPC) codes. In this paper, we consider LDPC codes for the binary erasure channel (BEC), use code rate for performance metric, and…
This article presents two methods, in parallel, of solving more complex integrals, among which is the Poisson's integral, in order to emphasize the obvious advantages of a new method of integration, which uses the supermathematics circular…
Quasipatterns (two-dimensional patterns that are quasiperiodic in any spatial direction) remain one of the outstanding problems of pattern formation. As with problems involving quasiperiodicity, there is a small divisor problem. In this…
It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…
We consider positive singular solutions to semilinear elliptic problems with possibly singular nonlinearity. We deduce symmetry and monotonicity properties of the solutions via the moving plane procedure.
It is well known that quantum codes can be constructed by means of classical symplectic dual-containing codes. This paper considers a family of two-generator quasi-cyclic codes and derives sufficient conditions for these codes to be…
In this short note, we simply collect some known results about representing algebraic cycles by various kind of "nice" (e.g. smooth, local complete intersection, products of local complete intersection) algebraic cycles, up to rational…
Stochastic partial differential equations (SPDEs) are often difficult to solve numerically due to their low regularity and high dimensionality. These challenges limit the practical use of computer-aided studies and pose significant barriers…
We develop a simple recursive approach to treat reversible condensation polymerization with cyclization. Based upon a minimum set of balance equations, the law of mass action, Gaussian chain statistics, and the assumption of independent…
In this paper, we propose a class of linear codes and obtain their weight distribution. Some of these codes are almost optimal. Moreover, several classes of constant composition codes(CCCs) are constructed as subcodes of linear codes.
In this paper we give stochastic solutions of conformable fractional Cauchy problems. The stochastic solutions are obtained by running the processes corresponding to Cauchy problems with a nonlinear deterministic clock.
In this paper, we propose Hermite collocation method for solving Thomas-Fermi equation that is nonlinear ordinary differential equation on semi-infinite interval. This method reduces the solution of this problem to the solution of a system…
We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and…
The aim of the present work is the introduction of a viscosity type solution, called strong-viscosity solution to distinguish it from the classical one, with the following peculiarities: it is a purely analytic object; it can be easily…