Research
Research
Research
Research
8,926+ open-access research outputs.
We study square-base Calderbank--Shor--Steane (CSS) hypergraph-product codes as a finite-length class for regular high-girth quantum low-density parity-check (LDPC) design. For base matrices of small …
We study the problem of online coloring for graphs with large odd girth. The best previously known algorithm uses $O(n^{1/2})$ colors, which was discovered by Kierstead in 1998. This algorithm works w…
The evolution of protoplanetary disks, especially in the early stages of planetary formation, as dust grows, is the cornerstone of the birth of planets. The mechanisms involved in the growth of sub-mi…
Motivated by an optimal-matching problem (Leighton-Shor) and the random-field Ising model (Aizenman-Wehr, Ding-Wirth), we consider a variational problem for graphs in $1+1$ dimension maximizing an act…
Context. Growing evidence is revealing the crucial role of binarity in massive star evolution. This affects evolution models and demands a refinement of the available observational constraints. Aims. …
Vision-language models have shown strong performance, but they often generalize poorly to specialized domains. While semi-supervised vision-language learning mitigates this limitation by leveraging a …
The start of a human's life can be characterized by two lotteries: that of your genes (nature) and the family you were born into (nurture). These set in motion a trajectory, from birth onward, in heal…
Subdividing an edge $uv$ in a graph replaces it by a path $u w v$ with one new vertex. For a graph $H$, the \textsc{$H$-free Subdivision} problem asks whether, given a graph $G$ and an integer $k$, on…
This paper considers multiple extended object tracking based on Poisson multi-Bernoulli mixture (PMBM) filtering, which gives the closed-form Bayesian solution for standard multiple extended object mo…
Temporal graphs are graphs whose edges are only present at certain points in time. Reachability in these graphs relies on temporal paths, where edges are traversed chronologically. A temporal graph th…
Clinical framing -- the linguistic manner in which clinical information is presented -- can influence patient understanding and decision-making, with important implications for healthcare outcomes. Ob…
In this paper, we introduce a problem closely related to the {\emph{Cage Problem}}. We are interested in {\emph{Balanced Biregular Cages}}, which are the smallest biregular graphs of fixed girth that …
In both observational studies and randomized trials, post-treatment events such as dropout, nonadherence, and truncation by death occur frequently. In some studies, conditioning on post-treatment vari…
Autocatalytic processes underlie diverse systems in which replication is triggered at interfaces, including heterogeneous catalysis on solid substrates, enzyme activity at membranes, viral infections,…
A $k$-regular graph of girth $g$ is called vertex-girth-regular if every vertex is contained in the same number of cycles of length $g$. For integers $n, k, g$ and $\lambda$, we denote such a graph on…
A graph reaction--diffusion (RD) equation is a system of differential equations that is defined on the nodes of a graph. Consider a sequence of growing graphs that converges in cut norm to a limiting …
We construct a quantum low-density parity-check code family from a length-$512$ Calderbank--Shor--Steane base matrix pair. The base pair is permutation-equivalent to the known SPC(3) product CSS code,…
We develop a likelihood-based inference for finite-state birth-death processes with composite birth rates, in which multiple distinct mechanisms contribute additively to the total birth intensity. Our…
We study the surjectivity of certain maps involving local cohomology modules, which we can realize as a dual version of part of the investigation developed by Bhatt, Blickle, Lyubeznik, Singh and Zhan…
Let $k$ be a field of characteristic $p,$ and $f : X \to S$ a smooth proper morphism of smooth $k$-schemes. Katz's formula gives a relationship between the Kodaira--Spencer map of $f,$ and an invarian…
Free open-access publishing with Google Scholar indexing.
Submission Guide →