Quantum mechanics could be studied through polynomial algebra, as has been demonstrated by a work (“An approach to first-principles electronic structure calculation by symbolic-numeric computation” by A. Kikuchi). We carry forward the algebraic method of quantum mechanics through algebraic number theory; the basic equations are represented by the multivariate polynomial ideals; the symbolic computations process the ideal and disentangle the eigenstates as the algebraic variety; upon which one canbuild the Galois extension of the number field, in analogy with the univariate polynomial case, to investigate the hierarchy of solutions; the Galois extension is accompanied with the group operations, which permute the eigenstates from one to another, and furnish the quantum system with a non-apparent symmetry. Besides, this sort of algebraic quantum mechanics is an embodiment of the class field theory; some of the important consequences of the latter emerge in quantum mechanics. We shall demonstrate these points through simple models; we will see the use of computational algebra facilitates such sort of analysis, which might often be complicated if we try to solve them manually.

Elliptic scator algebra is possible in 1+n dimensions, n∈N. It is isomorphic to complex algebra in 1+1 dimensions, when the real part and any one hypercomplex component are considered. It is endowed with two representations: an additive one, where the scator components are represented as a sum; and a polar representation, where the scator components are represented as products of exponentials. Within the scator framework, De Moivre’s formula is generalized to 1+n dimensions in the so called victoria equation. This novel formula is then used to obtain compact expressions for the integer powers of scator elements. A scator in S1+n can be factored into a product of n scators that are geometrically represented as its projections onto n two dimensional planes. A geometric interpretation of scator multiplication in terms of rotations with respect to the scalar axis is expounded. The powers of scators, when the ratio of their director components is a rational number, lie on closed curves. For 1+2 dimensional scators, twisted curves in a three dimensional space are obtained. Collecting previous results, it is possible to evaluate the exponential of a scator element in 1+2 dimensions.

A new generation of universal tools and languages for modeling and simulation multi-physical domain applications emerged and became widely accepted, which generate large-scale systems of differential algebraic equations (DAEs) automatically. Motivated by the characteristics of DAEs systems with large dimension, high index or block structures, we first propose a modified Pantelides’ algorithm (MPA) for any high order DAEs based on its Σ matrix, which is similar to Pryce’s Σ method. By introducing a vital parameter vector, a modified Pantelides’ algorithm with parameter has been presented.It leads to a block Pantelides’ algorithm (BPA) naturally which can immediately compute the crucial canonical offsets for whole (coupled) systems with block-triangular form. We illustrate these algorithms by some examples. And numerical experiments show that the time complexity of BPA can be reduced by at least O(ℓ) compared to the MPA, which is mainly consistent with the results of our analysis.

In this paper defines the consecutive sum of the digits of a natural number, so far as it becomes less than ten, as an arithmetic function called and then introduces some important properties of this function by proving a few theorems in a way that they can be used as a powerful tool in many cases. As an instance, by introducing a test called test, it has been shown that we are able to examine many algebraic equalities in the form of in which and are arithmetic functions and to easily study many of the algebraic and diophantine equations in the domain of whole numbers. The importance of test for algebraic equalities can be considered equivalent to dimensional equation in physics relations and formulas. Additionally, this arithmetic function can also be useful in factorizing the composite odd numbers.

YH-DIE must have continuity . Given the basic algebraic clusters of homogeneous configurations,we can get the basic three equations: \begin{array}{l} {\mathop{\int}\nolimits_{0}\nolimits^{{x}_{i}}{\frac{{G}\left({{x}_{i}\mathrm{,}s}\right)}{{\left({{x}_{i}\mathrm{{-}}{s}}\right)}^{\mathit{\alpha}}}\mathrm{\varphi}\left({s}\right){ds}}\mathrm{{=}}{f}\left({{x}_{i}}\right)}\ ;\ {\frac{\mathrm{\partial}}{\mathrm{\partial}{x}_{i}}\left({\frac{{\mathrm{\partial}}_{{x}_{i}}G}{\sqrt{{1}\mathrm{{+}}{\left|{\mathrm{\nabla}{G}}\right|}^{2}}}}\right)\mathrm{{=}}{0}}\ ;\ {{i}\mathrm{{=}}\mathop{\sum}\limits_{{x}_{i}\mathrm{{=}}{1}}\limits^{\mathrm{\infty}}{\arccos\hspace{0.33em}\mathrm{\varphi}\left({{x}_{i}}\right)}\mathrm{{=}}{f}\left({\fbox{${Yuh}$}}\right)} \end{array} YH-DIE has become a fusion point and access point in the fields of algebraic geometry and partial differential equations, and its mapping on multidimensional algebraic clusters or manifolds is very special. The minimal surface equation is a special case.

We consider Pisot family substitution tilings in $\R^d$ whose dynamical spectrum is pure point. There are two cut-and-project schemes(CPS) which arise naturally: one from the Pisot family property and the other from the pure point spectrum respectively. The first CPS has an internal space $\R^m$ for some integer $m \in \N$ defined from the Pisot family property, and the second CPS has an internal space $H$ which is an abstract space defined from the property of the pure point spectrum. However it is not known how these two CPS's are related. Here we provide a sufficient condition to make a connection between the two CPS's. In the case of Pisot unimodular substitution tiling in $\R$, the two CPS's turn out to be same due to [5, Remark 18.5].

Taking a DNA-sequence, a word with letters/bases A, T, G and C, as the relation between the generators of an infinite group $\pi$, one can discriminate two important families: (i) the cardinality structure for conjugacy classes of subgroups of $\pi$ is that of a free group on $1$ to $4$ bases and the DNA word, viewed as a substitution sequence, is aperiodic. (ii) The cardinality structure for conjugacy classes of subgroups of $\pi$ is not that of a free group, the sequence is generally not aperiodic and topological properties of $\pi$ have to be determined differently. The two cases rely on DNA conformations such as A-DNA, B-DNA, Z-DNA, G-quadruplexes, etc. We found a few salient results: Z-DNA, when involved in transcription, replication and regulation in a healthy situation implies (i). The sequence of telomeric repeats comprising $3$ distinct bases, most of the time, satisfies (i). For $2$-base sequences in the free case (i) or non free case (ii), the topology of $\pi$ may be found in terms of the $SL(2,\mathbb{C})$ character variety of $\pi$ and the attached algebraic surfaces. The linking of two unknotted curves --the Hopf link-- may occur in the topology of $\pi$ in cases of biological importance, in telomeres, G-quadruplexes, hairpins and junctions, a feature we already found in the context of models of topological quantum computing. For $3$- and $4$ base sequences, other knotting configurations are noticed and a building block of the topology is the $4$-punctured sphere. Our methods have the potential to discriminate potential diseases associated to the sequences.

It is shown that the representation theory of some finitely presented groups thanks to their $SL_2(\mathbb{C})$ character variety is related to algebraic surfaces. We make use of the Enriques-Kodaira classification of algebraic surfaces and the related topological tools to make such surfaces explicit. We study the connection of $SL_2(\mathbb{C})$ character varieties to topological quantum computing (TQC) as an alternative to the concept of anyons. The Hopf link $H$, whose character variety is a Del Pezzo surface $f_H$ (the trace of the commutator), is the kernel of our view of TQC. Qutrit and two-qubit magic state computing, derived from the trefoil knot in our previous work, may be seen as TQC from the Hopf link. The character variety of some two-generator Bianchi groups as well as that of the fundamental group for the singular fibers $\tilde{E}_6$ and $\tilde{D}_4$ contain $f_H$. A surface birationally equivalent to a $K_3$ surface is another compound of their character varieties.

Transcription factors (TFs) and microRNAs (miRNAs) are co-actors in genome-scale decoding and regulatory networks, often targeting common genes. In this paper, we describe the algebraic geometry of both TFs and miRNAs thanks to group theory. In TFs, the generator of the group is a DNA-binding domain while, in miRNAs, the generator is the seed of the sequence. For such a generated (infinite) group $\pi$, we compute the $SL(2,\mathbb{C})$ character variety, where $SL(2,\mathbb{C})$ is simultaneously a \lq space-time' (a Lorentz group) and a \lq quantum' (a spin) group. A noteworthy result of our approach is to recognize that optimal regulation occurs when $\pi$ looks like a free group $F_r$ ($r =1$ to $3$) in the cardinality sequence of its subgroups, a result obtained in our previous papers. A non free group structure features a potential disease. A second noteworthy result is about the structure of the Groebner basis $\mathcal{G}$ of the variety. A surface with simple singularities (like the well known Cayley cubic) within $\mathcal{G}$ is a signature of a potential disease even when $G$ looks like a free group $F_r$ in its structure of subgroups. Our methods apply to groups with a generating sequence made of two to four distinct DNA/RNA bases in $\{A,T/U,G,C\}$. Several human TFs and miRNAs are investigated in detail thanks to our approach.

It is quite easy to stochastically distort an original count variable to obtain a new count variable with relatively more variability than in the original variable. Many popular overdispersion models (variance greater than mean) can indeed be obtained by mixtures, compounding or randomlystopped sums. There is no analogous stochastic mechanism for the construction of underdispersed count variables (variance less than mean), starting from an original count distribution of interest. This work proposes a generic method to stochastically distort an original count variable to obtain a new count variable with relatively less variability than in the original variable. The proposed mechanism, termed condensation, attracts probability masses from the quantiles in the tails of the original distribution and redirect them toward quantiles around the expected value. If the original distribution can be simulated, then the simulation of variates from a condensed distribution is straightforward. Moreover, condensed distributions have a simple mean-parametrization, a characteristic useful in a count regression context. An application to the negative binomial distribution resulted in a distribution allowing under, equi and overdispersion. In addition to graphical insights, fields of applications of special cases of condensed Poisson and condensed negative binomial distributions were pointed out as an indication of the potential of condensation for a flexible analysis of count data

Revealing the time structure of physical or biological objects is usually performed thanks to the tools of signal processing like the fast Fourier transform, Ramanujan sum signal processing and many other techniques. For space-time topological objects in physics and biology, we propose a type of algebraic processing based on schemes in which the discrimination of singularities within objects is based on the space-time-spin group SL(2,C). Such topological objects possess an homotopy structure encoded in their fundamental group and the related SL(2,C) multivariate polynomial character variety contains a plethora of singularities somehow analogous to the frequency spectrum in time structures. Our approach is applied to an Akbulut cork in exotic R4, to an hyperbolic model of topological quantum computing based on algebraic surfaces and to microRNAs in genetics. Such diverse topics reveal the manifold of possibilities of using the concept of a scheme spectrum.

In this article we present a SCILAB implementation of algebraic iterative reconstruction methods for discretisation of inverse problems in imaging. These so-called row action methods rely on semi-convergence for achieving the necessary regularisation of the problem. We implement this method using SCILAB and provide a few simplified test problems: medical tomography, seismic tomography and walnut tomography.Numerical results show the capability of this method for the original and perturbed right-hand side vector.

The article presents the author's results of studying hidden rules of structural organizations of long DNA sequences in eukaryotic and prokaryotic genomes. The results concern some rules of percentages (or probabilities) of n-plets in genomes. To reveal such rules, the author considers genomic DNA nucleotide sequences as multilayers sequences of n-plets and studies the percentage contents of n-plets in different layers. Unexpected rules of invariance of total sums of percentages in certain tetra-groupings of n-plets in different layers of genomic DNA sequences are revealed. These discovered rules are candidates for the role of universal genomic rules. A tensor family of matrix representations of interrelated DNA-alphabets of 4 nucleotides, 16 doublets, 64 triplets, and 256 tetraplets is used in the study. This matrix approach allows revealing algebraic properties of the mentioned genetic rules of probabilities, which are useful for developing algebraic and quantum biology. Some analogies of the discovered genetic phenomena with phenomena of Gestalt psychology are noted and discussed. The author connects the received results about the genomic percentages rules with a supposition of P. Jordan, who is one of the creators of quantum mechanics and quantum biology, that life's missing laws are the rules of chance and probability of the quantum world. Additional attention is paid to the algebraic features of the system of structured DNA alphabets and their relationship with the methods of algebraic holography, known in the technique of processing discrete signals. The concept of algebraic-holographic genetics is being developed for the understanding of inherited holographic properties of organisms.

A new framework in quantum chemistry has been proposed recently ("An approach to first principles electronic structure calculation by symbolic-numeric computation'' by A. Kikuchi). It is based on the modern technique of computational algebraic geometry, viz. the symbolic computation of polynomial systems. Although this framework belongs to molecular orbital theory, it fully adopts the symbolic method. The analytic integrals in the secular equations are approximated by the polynomials. The indeterminate variables of polynomials represent the wave-functions and other parameters for the optimization, such as atomic positions and contraction coefficients of atomic orbitals. Then the symbolic computation digests and decomposes the polynomials into a tame form of the set of equations, to which numerical computations are easily applied. The key technique is Grröbner basis theory, by which one can investigate the electronic structure by unraveling the entangled relations of the involved variables. In this article, at first, we demonstrate the featured result of this new theory. Next, we expound the mathematical basics concerning computational algebraic geometry, which are necessitated in our study. We will see how highly abstract ideas of polynomial algebra would be applied to the solution of the definite problems in quantum mechanics. We solve simple problems in "quantum chemistry in algebraic variety'' by means of algebraic approach. Finally, we review several topics related to polynomial computation, whereby we shall have an outlook for the future direction of the research.

This paper establishes methods that quantify the structure of statistical interactions within a given data set using the characterization of information theory in cohomology by finite methods, and provides their expression in terms of statistical physic and machine learning. Following [1–3], we show directly that k multivariate mutual-informations (I_k) are k-coboundaries. The k-cocycles are given by I_k = 0, which generalize statistical independence to arbitrary dimension k. The topological approach allows to investigate Shannon’s information in the multivariate case without the assumptions of independent identically distributed variables. We develop the computationally tractable subcase of simplicial information cohomology represented by entropy H_k and information I_k landscapes. The I₁ component defines a self-internal energy functional U_k, and (−1)^k I_k,k≥2 components define the contribution to a free energy functional G_k of the k-body interactions. The set of information paths in simplicial structures is in bijection with the symmetric group and random processes, provides a topological expression of the 2nd law and points toward a discrete Noether theorem (1st law). The local minima of free-energy, related to conditional information negativity and the non-Shannonian cone of Yeung [4], characterize a minimum free energy complex. This complex formalizes the minimum free-energy principle in topology, provides a definition of a complex system, and characterizes a multiplicity of local minima that quantifies the diversity observed in biology. Finite data size effects and estimation bias severely constrain the effective computation of the information topology on data, and we provide simple statistical tests for the undersampling bias and for the k-dependences following [5]. We give an example of application of these methods to genetic expression and cell-type classification. The maximal positive I_k identifies the variables that co-vary the most in the population, whereas the minimal negative I_k identifies clusters and the variables that differentiate-segregate the most. The methods unravel biologically relevant I₁₀ with a sample size of 41. It establishes generic methods to quantify the epigenetic information storage and a unified epigenetic unsupervised learning formalism.