相关论文: Arrow diagram method based on overlapping electron…

A fundamental question that shrouds the emergence of massively parallel computing (MPC) platforms is how can the additional power of the MPC paradigm be leveraged to achieve faster algorithms compared to classical parallel models such as…

A classical difficult isomorphism testing problem is to test isomorphism of p-groups of class 2 and exponent p in time polynomial in the group order. It is known that this problem can be reduced to solving the alternating matrix space…

Approximate Simultaneous Diagonalization (ASD) is a problem to find a common similarity transformation which approximately diagonalizes a given square-matrix tuple. Many data science problems have been reduced into ASD through ingenious…

In the preprint arXiv:2511.07900 we proved that there exists a localizing ring $A_M$ for $A$ an associative ring with unit, and $M=\oplus_{i=1}^rM_i$ a direct sum of $r\geq 1$ simple right $A$-modules. For a homomorphism of associative…

A comprehensive and detailed account is presented for the finite-temperature many-body perturbation theory for electrons that expands in power series all thermodynamic functions on an equal footing. Algebraic recursions in the style of the…

To date, computational methods for modeling defects (vacancies, adsorbates, etc.) rely on periodic supercells in which the defect is far enough from its repeated image such that they can be assumed non-interacting. Yet, the relative…

When the number of strongly correlated electrons becomes larger, the single-reference coupled-cluster (CC) CCSD, CCSDT, etc. hierarchy displays an erratic behavior, while traditional multi-reference approaches may no longer be applicable…

A recently developed linear algebraic method for the computation of perturbation expansion coefficients to large order is applied to the problem of a hydrogenic atom in a magnetic field. We take as the zeroth order approximation the $D…

We address the novel structures arising in quantum and string integrable theories, as well as construct methods to obtain them and provide further analysis. Specifically, we implement the automorphic symmetries on periodic lattice systems…

We propose ADOM - an accelerated method for smooth and strongly convex decentralized optimization over time-varying networks. ADOM uses a dual oracle, i.e., we assume access to the gradient of the Fenchel conjugate of the individual loss…

The PARAFAC2 model provides a flexible alternative to the popular CANDECOMP/PARAFAC (CP) model for tensor decompositions. Unlike CP, PARAFAC2 allows factor matrices in one mode (i.e., evolving mode) to change across tensor slices, which has…

An abstract topological graph (AT-graph) is a pair $A=(G,\mathcal{X})$, where $G=(V,E)$ is a graph and $\mathcal{X} \subseteq {E \choose 2}$ is a set of pairs of edges of $G$. A realization of $A$ is a drawing $\Gamma_A$ of $G$ in the plane…

Graph anomaly detection (GAD) is critical for identifying abnormal nodes in graph-structured data from diverse domains, including cybersecurity and social networks. The existing GAD methods often focus on the learning paradigms of…

Alzheimer's Disease (AD) is an irreversible neurodegenerative disease characterized by progressive cognitive decline as its main symptom. In the research field of deep learning-assisted diagnosis of AD, traditional convolutional neural…

Hypergraphs, encoding structured interactions among any number of system units, have recently proven a successful tool to describe many real-world biological and social networks. Here we propose a framework based on statistical inference to…

To the best of our knowledge, a complete characterization of the domains that escape the famous Arrow's impossibility theorem remains an open question. We believe that different ways of proving Arrovian theorems illuminate this problem.…

We develop a combinatorial approach to the study of semigroups and monoids with finite presentations satisfying small overlap conditions. In contrast to existing geometric methods, our approach facilitates a sequential left-right analysis…

We analyze the convergence of the (algebraic) multiplicative Schwarz method applied to linear algebraic systems with matrices having a special block structure that arises, for example, when a (partial) differential equation is posed and…

Nonlinear and nonaffine terms in parametric partial differential equations can potentially lead to a computational cost of a reduced order model (ROM) that is comparable to the cost of the original full order model (FOM). To address this,…

We use the recently calculated two--loop anomalous dimensions of current-current operators, QCD and electroweak penguin operators to construct the effective Hamiltonian for $\Delta S=1$ transitions beyond the leading logarithmic…