4,178+ open-access research outputs.
In modern parametric model training, full-batch gradient descent (and its variants) suffers due to progressively stronger biasing towards the exact realization of training data; this drives the systemโฆ
Mirror symmetry predicts an action by the fundamental group of a conjectural stringy K\"ahler moduli space on the derived category of an algebraic variety. For a toric variety, a model for this space โฆ
The embeddings of complex plane projective curves in the plane are a cornerstone of the topological study of algebraic varieties. In this work, we deal with the local and global aspects of these embedโฆ
This paper presents a projection-based technique to mitigate the impact of modeling errors related to domain truncation, changes in the optode coupling coefficients, and misspecified optical parameterโฆ
This article presents a partial differential equation (PDE) of Keller-Segel (KS) type that reproduces patterns commonly observed during the growth of brain microvasculature. We provide mathematical inโฆ
We develop a Koszul-theoretic framework for comparing classical Alexander-type invariants with infinitesimal invariants arising from finite-type commutative differential graded algebra models. The cenโฆ
Understanding the structure of the brain, and how it changes with time and disease, is a core goal of structural neuroimaging. Contemporary approaches to structural brain analysis are dominated by voxโฆ
The higher Bruhat orders are partial orders that generalize the weak order on the symmetric group $S_n$, and the second higher Bruhat order is a poset on commutation classes of reduced words for the lโฆ
Electroencephalography (EEG) source imaging aims to infer brain activity from electrical potentials measured on the scalp. This is a difficult problem because many different source patterns can explaiโฆ
In this note we consider a two-dimensional semi-discrete dislocation energy and propose a simple and physically motivated construction for the grain boundary between two crystal grains with a small orโฆ
We introduce linear representations of the universal virtual braid group $UV_n(c)$, where $n\geq 2$ and $c\geq 1$, which is a unifying framework for braid-type groups with multiple types of crossings.โฆ
Alzheimer's disease is the most common neurodegenerative disorder. Its pathological development is connected with the misfolding and accumulation of two toxic proteins: amyloid-beta and tau proteins. โฆ
We study polynomial optimization problems whose objective has a composition or tensor train structure. These polynomials can be evaluated as a sequence of maps, giving rise to intermediate variables (โฆ
The conjugacy problem in braid groups has been extensively studied, particularly from an algorithmic perspective. Established methods based on Garside structures, such as initial summit sets and superโฆ
There are only three known strongly invertible hyperbolic L-space knots with braid index four and tunnel number two. They are t09284, t10496 and o9_34409 in the SnapPy census. In this paper, we give tโฆ
Predictive inference in the sparse Gaussian sequence model has received considerably less attention than its non-sparse, finite-sample counterpart. Existing work has largely been confined to discrete โฆ
Given a group $G$ and an integer $n \geq 0$, let $\mathcal{F}_n$ denote the family of all virtually abelian subgroups of $G$ of rank at most $n$. In this article, we show that for each $n \geq 1$, theโฆ
We give a method for constructing an interactive art piece which illustrates two different definitions of the braid groups, along with their faithful action on the free group. The box also demonstrateโฆ
Long-horizon finite-control-set model predictive control (FCS-MPC) can improve transient regulation and flying-capacitor balancing in flying-capacitor three-level boost converters (FC-TLBCs). However,โฆ
For each integer $n\ge 1$, after fixing a proper complexity function on the braid group $\B_{2n}$, we use the Dehornoy order to define a strict total order on the set \[ \mathcal P_{2n}=H_{2n}\backslaโฆ
Free open-access publishing with Google Scholar indexing.
Submission Guide โ