On the divisibility among power GCD and power LCM matrices on gcd-closed sets

Let [Formula: see text] and [Formula: see text] be positive integers and let [Formula: see text] be a set of [Formula: see text] distinct positive integers. For [Formula: see text], one defines [Formula: see text]. We denote by [Formula: see text] (respectively, [Formula: see text]) the [Formula: see text] matrix having the [Formula: see text]th power of the greatest common divisor (respectively, the least common multiple) of [Formula: see text] and [Formula: see text] as its [Formula: see text]-entry. In this paper, we show that for arbitrary positive integers [Formula: see text] and [Formula: see text] with [Formula: see text], the [Formula: see text]th power matrices [Formula: see text] and [Formula: see text] are both divisible by the [Formula: see text]th power matrix [Formula: see text] if [Formula: see text] is a gcd-closed set (i.e. [Formula: see text] for all integers [Formula: see text] and [Formula: see text] with [Formula: see text]) such that [Formula: see text]. This confirms two conjectures of Shaofang Hong proposed in 2008.

Learning Deep Models: Critical Points and Local Openness

With the increasing popularity of nonconvex deep models, developing a unifying theory for studying the optimization problems that arise from training these models becomes very significant. Toward this end, we present in this paper a unifying landscape analysis framework that can be used when the training objective function is the composite of simple functions. Using the local openness property of the underlying training models, we provide simple sufficient conditions under which any local optimum of the resulting optimization problem is globally optimal. We first completely characterize the local openness of the symmetric and nonsymmetric matrix multiplication mapping. Then we use our characterization to (1) provide a simple proof for the classical result of Burer-Monteiro and extend it to noncontinuous loss functions; (2) show that every local optimum of two-layer linear networks is globally optimal. Unlike many existing results in the literature, our result requires no assumption on the target data matrix [Formula: see text], and input data matrix [Formula: see text]; (3) develop a complete characterization of the local/global optima equivalence of multilayer linear neural networks (we provide various counterexamples to show the necessity of each of our assumptions); and (4) show global/local optima equivalence of overparameterized nonlinear deep models having a certain pyramidal structure. In contrast to existing works, our result requires no assumption on the differentiability of the activation functions and can go beyond “full-rank” cases.

Development of Dry Drilling Diamond Bit and Drilling System

This paper summarizes the current situation, market demand and existing problems of dry drilling for stone and building materials construction at home and abroad. The use and characteristics of dry drilling, the structural design of dry drilling diamond bit and the selection of matrix formula are introduced. Finally, through the test of drilling reinforced concrete with long dry drilling bits, the related equipment of the complete dry drilling system is introduced in detail.

On the Generalized Strongly Nil-Clean Property of Matrix Rings

Let [Formula: see text] be an associative unital ring and not necessarily commutative. We analyze conditions under which every [Formula: see text] matrix [Formula: see text] over [Formula: see text] is expressible as a sum [Formula: see text] of (commuting) idempotent matrices [Formula: see text] and a nilpotent matrix [Formula: see text].

Random Toeplitz matrices: The condition number under high stochastic dependence

In this paper, we study the condition number of a random Toeplitz matrix. As a Toeplitz matrix is a diagonal constant matrix, its rows or columns cannot be stochastically independent. This situation does not permit us to use the classic strategies to analyze its minimum singular value when all the entries of a random matrix are stochastically independent. Using a circulant embedding as a decoupling technique, we break the stochastic dependence of the structure of the Toeplitz matrix and reduce the problem to analyze the extreme singular values of a random circulant matrix. A circulant matrix is, in fact, a particular case of a Toeplitz matrix, but with a more specific structure, where it is possible to obtain explicit formulas for its eigenvalues and also for its singular values. Among our results, we show the condition number of a non-symmetric random circulant matrix [Formula: see text] of dimension [Formula: see text] under the existence of the moment generating function of the random entries is [Formula: see text] with probability [Formula: see text] for any [Formula: see text], [Formula: see text]. Moreover, if the random entries only have the second moment, the condition number satisfies [Formula: see text] with probability [Formula: see text]. Also, we analyze the condition number of a random symmetric circulant matrix [Formula: see text]. For the condition number of a random (non-symmetric or symmetric) Toeplitz matrix [Formula: see text] we establish [Formula: see text], where [Formula: see text] is the minimum singular value of the matrix [Formula: see text]. The matrix [Formula: see text] is a random circulant matrix and [Formula: see text], where [Formula: see text] are deterministic matrices, [Formula: see text] indicates the conjugate transpose of [Formula: see text] and [Formula: see text] are random diagonal matrices. From random experiments, we conjecture that [Formula: see text] is well-conditioned if the moment generating function of the random entries of [Formula: see text] exists.

TIMING OPTIMIZATION OF HEAD AND NECK CT ANGIOGRAPHY VIA THE INVERSE PROBLEM ALGORITHM: IN VIVO SURVEY FOR 1001 PATIENTS IN 2020–2021

This study processed the recent in vivo survey results for over a thousand patients and optimized their neck and head CT angiography triggered timing (CTA-TT) via the inverse problem algorithm, which ensured the maximal ratio of both left and right arterial to upper sinuses (LRA/US). These results are instrumental in examining the ischemic stroke syndromes along the neck and head. These 1001 patients were randomly categorized into test surveyed (802 patients) and verification group (199 patients), then a six factors semi-empirical formula was constructed by the STATISTICA program. The six factors were assigned a patient’s biological data and preset of the CTA facility; namely Age, mean arterial pressure (MAP), heart rate (HR), contrast media dose (CMD), Pre (injected pressure of CMD), and body surface area (BSA). Each factor was normalized into dimensionless values and incorporated into the dataset matrix [Formula: see text] to analyze the coefficient matrix [Formula: see text]. The derived semi-empirical formula closely correlated with experimental data, according to the loss function [Formula: see text], correlation coefficient [Formula: see text], and variance of 0.8965. The formula verification for 199 more patients (verification group) yielded a correlation coefficient [Formula: see text]. Thus, it can be used for the CTA-TT estimation of patients without their preliminary tests, avoiding unnecessary irradiation. The estimated LRA/US was [Formula: see text] for the verification group in this study. A simplified three-factor formula, featuring only age, MAP, and BSA, was also proposed.

On generalized Fibonacci difference sequence spaces and compact operators

In this paper, we introduce Fibonacci backward difference operator [Formula: see text] of fractional order [Formula: see text] by the composition of Fibonacci band matrix [Formula: see text] and difference operator [Formula: see text] of fractional order [Formula: see text] defined by [Formula: see text] and introduce sequence spaces [Formula: see text] and [Formula: see text] We present some topological properties, obtain Schauder basis and determine [Formula: see text]-, [Formula: see text]- and [Formula: see text]-duals of the spaces [Formula: see text] and [Formula: see text] We characterize certain classes of matrix mappings from the spaces [Formula: see text] and [Formula: see text] to any of the space [Formula: see text] [Formula: see text] [Formula: see text] or [Formula: see text] Finally we compute necessary and sufficient conditions for a matrix operator to be compact on the spaces [Formula: see text] and [Formula: see text]

A unified Yukawa interaction for the Standard Model of quarks and leptons

To address fermion mass hierarchy and flavor mixings in the quark and lepton sectors, a minimal flavor structure without any redundant parameters beyond phenomenological observables is proposed via decomposition of the Standard Model Yukawa mass matrix into a bi-unitary form. After reviewing the roles and parameterization of the factorized matrix [Formula: see text] and [Formula: see text] in fermion masses and mixings, we generalize the mechanism to up- and down-type fermions to unify them into a universal quark/lepton Yukawa interaction. In the same way, a unified form of the description of the quark and lepton Yukawa interactions is also proposed, which shows a similar picture as the unification of gauge interactions.

Hamiltonian trace graph of matrices

Let [Formula: see text] be a commutative ring with identity, [Formula: see text] be a positive integer and [Formula: see text] be the set of all [Formula: see text] matrices over [Formula: see text] For a matrix [Formula: see text] Tr[Formula: see text] is the trace of [Formula: see text] The trace graph of the matrix ring [Formula: see text] denoted by [Formula: see text] is the simple undirected graph with vertex set [Formula: see text][Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if Tr[Formula: see text] The ideal-based trace graph of the matrix ring [Formula: see text] with respect to an ideal [Formula: see text] of [Formula: see text] denoted by [Formula: see text] is the simple undirected graph with vertex set [Formula: see text] and two distinct vertices [Formula: see text] and [Formula: see text] are adjacent if and only if Tr[Formula: see text] In this paper, we investigate some properties and structure of [Formula: see text] Further, it is proved that both [Formula: see text] and [Formula: see text] are Hamiltonian.

Inverse eigenvalue problem for Jacobi matrix and nonnegative matrices

In this paper, we present a method for constructing a Jacobi matrix [Formula: see text] using [Formula: see text] known eigenvalues [Formula: see text]. Some conditions are also given under which the constructed matrix is nonnegative and its diagonal entries are specified. Finally, we present a technique for constructing symmetric and nonsymmetric nonnegative matrices by their eigenvalues.