We propose a fast local level set method for the inverse problem of gravimetry. The theoretical foundation for our approach is based on the following uniqueness result: if an open set D is star-shaped or x₃-convex with respect to its center of gravity, then its exterior potential uniquely determines the open set D. To achieve this purpose constructively, the first challenge is how to parametrize this open set D as its boundary may have a variety of possible shapes. To describe those different shapes we propose to use a level-set function to parametrize the unknown boundary of this open set. The second challenge is how to deal with the issue of partial data as gravimetric measurements are only made on a part of a given reference domain . To overcome this difficulty we propose a linear numerical continuation approach based on the single layer representation to find potentials on the boundary of some artificial domain

It is known that every complex square matrix with nonnega-tive determinant is the product of positive semi-definite matrices. There are characterizations of matrices that require two or five positive semi-definite matrices in the product. However, the characterizations of matrices that require three or four positive semi-definite matrices in the product are lacking. In this paper, we give a complete characterization of these two types of matrices. With these results, we give an algorithm to determine whether a square matrix can be expressed as the product of kpositive semi-definite matrices but not fewer, for k=1, 2, 3, 4, 5.

Numerical encoding plays an important role in DNA sequence analysis via computational methods, in which numerical values are associated with corresponding symbolic characters. After numerical representation, digital signal processing methods can be exploited to analyze DNA sequences. To reflect the biological properties of the original sequence, it is vital that the representation is one-to-one. Chaos Game Representation (CGR) is an iterative mapping technique that assigns each nucleotide in a DNA sequence to a respective position on the plane that allows the depiction of the DNA sequence in the form of image. Using CGR, a biological sequence can be transformed one-to-one to a numerical sequence that preserves the main features of the original sequence. In this research, we propose to encode DNA sequences by considering 2D CGR coordinates as complex numbers, and apply digital signal processing methods to analyze their evolutionary relationship. Computational experiments indicate that this approach gives comparable results to the state-of-the-art multiple sequence alignment method, Clustal Omega, and is significantly faster. The MATLAB code for our method can be accessed from: www.mathworks.com/matlabcentral/fileexchange/57152

The bran fraction of wheat grain is known to contain significant quantities of bioactive components. This study evaluated the potential of solid-state yeast fermentation to improve the health beneficial properties of wheat bran, including extractable antioxidant properties, protein contents, and soluble and insoluble fiber compositions. Three commercial food grade yeast preparations were evaluated in the study along with the effects of yeast dose, treatment time, and their interaction with the beneficial components. Solid-state yeast treatments were able to significantly increase releasable antioxidant properties ranging from 28 to 65, from 0 to 20, from 13 to 19, from 0 to 25, from 50 to 100, and from 3 to 333% for scavenging capacities against peroxyl (ORAC), ABTS cation, DPPH and hydroxyl radicals, total phenolic contents (TPC), and phenolic acids, respectively. Yeast treatment increased protein content 11-12% but did not significantly alter the fiber composition of wheat bran. Effects of solid-state yeast treatment on both ORAC and TPC of wheat bran were altered by yeast dose, treatment time, and their interaction. Results suggest that solid-state yeast treatment may be a commercially viable postharvest procedure for improving the health beneficial properties of wheat bran and other wheat-based food ingredients.

We give an overview of our philosophy of pictures in mathematics. We emphasize a bidirectional process between picture lan- guage and mathematical concepts: abstraction and simulation. This motivates a program to understand different subjects, using virtual and real mathematical concepts simulated by pictures.

Recent understandings of molecular evolution, together with the fossil records, have established that there are both linear and nonlinear processes in the creation of novel species, which is strikingly similar to the generation of prime numbers and human creativity. Each creation of a more complex species is like a prime number, unpredictable, discontinuous, and yet can be modeled by a smooth curve in relation to time. The mystery behind the complexity increases in nature and human civilizations might well turn out to be similar to that behind the appearances of prime numbers. Here we show that an algorithm for the creative process of humans can create prime numbers in a lawful and yet unpredictable fashion. The essence of primes is the duality of uniqueness and uniformity together with the creation algorithm. The algorithm consists of the non-linear process of uniformity selection to create the unique and the linear process of uniqueness selection to form the uniformity. The iterations of this algorithm can create an infinite number of primes. The algorithm appears to have been hardwired in the human brain as shown by recent experimental studies. This new understanding can deduce some of the best-known properties of primes and may explain the nearly constant and yet seemingly random creation of novelty in relation to time.

We show that if X is a uniformly perfect complete metric space satisfying the finite doubling property, then there exists a fully supported measure with lower regularity dimension as close to the lower dimension of X as we wish. Furthermore, we show that, under the condensation open set condition, the lower dimension of an inhomogeneous self-similar set EC coincides with the lower dimension of the condensation set C, while the Assouad dimension of EC is the maximum of the Assouad dimensions of the corresponding self-similar set E and the condensation set C. If the Assouad dimension of C is strictly smaller than the Assouad dimension of E, then the upper regularity dimension of any measure supported on EC is strictly larger than the Assouad dimension of EC. Surprisingly, the corresponding statement for the lower regularity dimension fails. 1

Recent consumer interest in controlling and preventing chronic diseases through improved diet has promoted research on the bioactive components of agricultural products. Wheat is an important agricultural and dietary commodity worldwide with known antioxidant properties concentrated mostly in the bran fraction. The objective of this study was to determine the relative contributions of genotype (G) and growing environment (E) to hard winter wheat bran antioxidant properties, as well as correlations of these properties to growing conditions. Bran samples of 20 hard winter wheat varieties grown in two locations were examined for their free radical scavenging capacities against DPPH, ABTS cation, peroxyl (ORAC), and superoxide anion radicals and chelating properties, as well as their total phenolics and phenolic acid compositions. Results showed significant differences for all antioxidant properties tested and multiple significant correlations between these properties. A factorial designed analysis of variance for these data and pooled previously published data showed similar results for four of the six antioxidant properties, indicating that G effects were considerably larger than E effects for chelating capacity and DPPH radical scavenging properties, whereas E was much stronger than G for ABTS cation radical scavenging capacity and total phenolics, although small interaction effects (G × E) were significant for all antioxidant properties analyzed. Results also showed significant correlations between temperature stress or solar radiation and some antioxidant properties. These results indicate that each antioxidant property of hard winter wheat bran is influenced differently by genotype and growing conditions.

The entanglement quantification and classification of multipartite quantum states is an important research area in quantum information. In this paper, in terms of the reduced density matrices corresponding to all possible partitions of the entire system, a bounded entanglement measure is constructed for arbitrary-dimensional multipartite quantum states. In particular, for three-qubit quantum systems, we prove that our entanglement measure satisfies the relation of monogamy. Furthermore, we present a necessary condition for characterizing maximally entangled states using our entanglement measure.

We propose the backward phase flow method to implement the FourierBrosIagolnitzer (FBI)-transform-based Eulerian Gaussian beam method for solving the Schrdinger equation in the semi-classical regime. The idea of Eulerian Gaussian beams has been first proposed in [12]. In this paper we aim at two crucial computational issues of the Eulerian Gaussian beam method: how to carry out long-time beam propagation and how to compute beam ingredients rapidly in phase space. By virtue of the FBI transform, we address the first issue by introducing the reinitialization strategy into the Eulerian Gaussian beam framework. Essentially we reinitialize beam propagation by applying the FBI transform to wavefields at intermediate time steps when the beams become too wide. To address the second issue, inspired by the original phase flow method, we propose the backward phase flow method which allows us to

Denote by Mnthe set of n ×ncomplex matrices. Let f:Mn→[0, ∞)be a continuous map such that f(μUAU∗) =f(A)for any complex unit μ, A ∈Mnand unitary U∈Mn, f(X) =0if and only if X=0and the induced map t →f(tX)is monotonically increasing on [0, ∞)for any rank onenilpotent X∈Mn. Characterization is given for surjective maps φon Mnsatisfying f(AB−BA) =f(φ(A)φ(B) −φ(B)φ(A)). The general theorem isthen used to deduce results on special cases when the function is the pseudo spectrum and the pseudo spectral radius.

No abstract uploaded!

We present and analyze a model for the evolution of the wealth distribution within a heterogeneous economic environment. The model considers a system of rational agents interacting in a game theoretical framework, through fairly general assumptions on the cost function. This evolution drives the dynamic of the agents in both wealth and economic configuration variables. We consider a regime of scale separation where the large scale dynamics is given by a hydrodynamic closure with a Nash equilibrium serving as the local thermodynamic equilibrium. The result is a system of gas dynamics-type equations for the density and average wealth of the agents on large scales. We recover the inverse gamma distribution as an equilibrium in the particular case of quadratic cost functions which has been previously considered in the literature.

We develop a model for the evolution of wealth in a non-conservative economic environment, extending a theory developed earlier by the authors. The model considers a system of rational agents interacting in a game theoretical framework. This evolution drives the dynamic of the agents in both wealth and economic configuration variables. The cost function is chosen to represent a risk averse strategy of each agent. That is, the agent is more likely to interact with the market, the more predictable the market, and therefore the smaller its individual risk. This yields a kinetic equation for an effective single particle agent density with a Nash equilibrium serving as the local thermodynamic equilibrium. We consider a regime of scale separation where the large scale dynamics is given by a hydrodynamic closure with this local equilibrium. A class of generalized collision invariants (GCIs) is developed to overcome the difficulty of the non-conservative property in the hydrodynamic closure derivation of the large scale dynamics for the evolution of wealth distribution. The result is a system of gas dynamics-type equations for the density and average wealth of the agents on large scales. We recover the inverse Gamma distribution, which has been previously considered in the literature, as a local equilibrium for particular choices of the cost function.

Protein universe is a complex system with critical problem of protein evolution to be analyzed. Early studies have used geometric distances and polygenetic-trees to solve this problem. However, the traditional methods are bivariate, whose taxonomy classification relies on bivariate branching. This is not sufficient to describe the complex nature of protein universe. Therefore, we propose a novel approach on multivariate protein classification. The new method bases on the theory of information and network, can be used to analyze multivariate relationships of proteins. The new method is alignment-free and have wide-applications to both sequences and 3D structures. We demonstrate the new method on six protein examples, results show that the new method is efficient and can potentially be used for future protein classifications.

We introduce the prime density triangle, a multiplicative array constructed by a modified rule of indices. Two display formats are given: a right-angle triangle with converted and unconverted entries, and an equilateral triangle obtained by mirroring the right-angle triangle about the central term xn. We derive the row-sum generat- ing function and provide worked examples using both direct computation and the generating function. Using a four-rule division scheme applied to the unconverted rows we obtain the sequence whose integer parts sum to the magic numbers for two spin orientations. Replacing the repeated end integers by 1,1 yields integer parts that give the standard harmonic oscillator (HO) magic numbers and, in conjunction with the two-spin-orientation nucleon magic numbers, gives precisely the standard nuclear magic numbers 2, 8, 20, 28, 50, 82, 126, 184. Furthermore, digital-root reduc- tion of the converted triangle reveals a distinct “4,9,9” pattern whose diagonals concatenate into large primes, establishing a direct arithmetic link between prime distribution and the symmetry conditions of nuclear shell closures. Subshell filling up to x9, deductions, and evidence from nuclear physics are included. A recurrence M = m ± [(n1n2) + 2] is presented for generating further magic numbers.The sequences appear as OEIS A005897, OEIS A018226 and OEIS A007290.

This note presents two original and creative divisibility tests for the integers 2 and 5. Both rules use the factorial of the last digit of a number, combined with a small correction when the factorial value would disrupt the required modular congruence. The resulting tests are mathematically equivalent to the classical last-digit rules but reach the same conclusion through an unconventional factorial-based approach. Each theorem includes a short proof sketch, an explanation of the mechanism, and four worked examples. The methods are valid precisely because 2 and 5 divide the base 10, allowing the last digit to fully determine the remainder modulo of these divisors. The work is intended as an accessible piece of recreational number theory for educational purposes.

The Prime Density Triangle offers a novel combinatorial framework for exploring properties of prime numbers. From the algebraic relations embedded within this triangle, specifically the coupled expressions X^p1± p1and X^p0± p0, we derive two closed-form sequences.First, the multiplication of these expressions yields the sequence Sn(m) = (mn+ n2)1/(n+2), which converges to m. Second, by a deliberate construction—replacing the additive denominator n + 2 with the multiplicative denominator 2n—we obtain the Exponential-Polynomial Root Mean (EPRM) defined by Rn(m) = (mn+ n2)1/(2n) for m > 0 and n ∈ N. This construction provides a closed-form, non-iterative method for approximating √m for sufficiently large n. In this paper, we present a complete derivation of both sequences from the Prime Den- sity Triangle’s algebraic frameworks, rigorous convergence proofs including asymptotic error analysis, detailed worked examples for m = 2, 3, 5 with explicit computations, numerical summary tables, explicit iterations for classical methods (Babylonian and Newton-Raphson), and a comprehensive comparison. The approach is elementary and highlights the dominance of exponential terms over polynomial corrections.

We introduce a triangular array of integers defined by a(n, k) = k(k + 1)n−k for n ≥ 1 and 1 ≤ k ≤ n, which we call the researcher’s triangle. The construction is multiplicative and differs from classical additive triangles such as Pascal’s. We give combinatorial interpretations using a leaders-followers model and a rooted hierarchical structure model. We identify several diagonal sequences as classical figurate numbers, including powers of two (A000079), natural numbers (A000027), and oblong numbers (A002378), and establish connections to triangular and tetrahedral numbers. We derive a bivariate generating function and a recurrence relation, and we discuss the row sums.

This paper investigates the sum of all non-Fibonacci integers that lie strictly between consecutive Fibonacci numbers. Starting from the operation a(n) = Mn− Fn, where Mn is that sum and Fn the preceding Fibonacci number, we obtain a sequence whose first three terms are themselves Fibonacci numbers: 1, 8, 34. We extend the exploration to seven other arithmetic operations (subtracting the next Fibonacci, adding either, multiplying either, and dividing either), and we systematically search for Fibonacci numbers that appear in each resulting sequence. We term such Fibonacci entries “lucky Fibonacci numbers”. Among all variants, only the addition and subtraction operations yield any lucky Fibonacci numbers: 1, 8, 34 (subtract previous), 5 (subtract next, ignoring the negative initial term), 21, 55 (add next), and none for add previous, nor for multiplication or division. We then apply the same gap-summing idea to other recurrent sequences: Lucas, Pell, and Tribonacci. For each, we find a small set of lucky Fibonacci numbers. All conjectures are verified computationally up to n = 200 (and up to Fibonacci F400), with no further hits found. The growth rates are exponential, making further coincidences increasingly improbable.