Research
Research
Research
Research
2,100+ open-access research outputs.
We establish a half-space theorem \`a la Hoffman and Meeks for nonlocal minimal surfaces. Differently from the classical case, our result holds in every dimension.…
Most galaxies have supermassive black holes (SMBH) at their centres, surrounded by stars with binary systems also present in this environment. We use two schemes - post-Newtonian (PN) and a scalar per…
We present a Spatially Embedded Evolutionary Algorithm where robot individuals exist in a physically simulated 2D environment, must navigate to encounter potential mates, and compete for survival unde…
Brualdi and Hoffman proposed a well-known problem of determining the graph with maximum adjacency spectral radius among all graphs with given size $m$. Early work by Friedland and Stanley addressed so…
Black Sigatoka disease (BSD), also known as black leaf streak disease, is an airborne fungal infection caused by \textit{Pseudocercospora fijiensis} that severely impacts global banana and plantain pr…
Sample average approximation (SAA) replaces an intractable expected objective by an empirical average and is a basic device of modern stochastic optimization. We develop a rate theory for optimal valu…
Motivated by the limited generalization of supervised image matching models to unseen image domains, we explore the zero-shot deployment of DINO features for this task. The generalist visual represent…
For the fixed-size Brualdi--Hoffman--Turan problem forbidding the fish graph $H(4,3)$, Zheng and Zhang proved that every $H(4,3)$-free graph of even size $m \ge 38$ without isolated vertices satisfies…
Determining the number of factors in high-dimensional factor models remains a fundamental challenge, particularly when data are incomplete. This paper introduces the concept of identifiable factors, t…
This note provides an introduction to selected topics in algebraic graph theory, including strongly regular graphs, Steiner systems, and automorphism groups. We describe constructions and properties o…
Linear convergence of first-order methods is typically characterized by global optimization conditions whose constants reflect worst-case geometry of the ambient space. In high-dimensional or structur…
In nature, estimating the location of a molecule source in turbulent airflow is a central, and yet highly challenging problem for mate search and foraging. Recently, it has also received increasing at…
Object extraction tasks often occur in disassembly problems, where bolts, screws, or pins have to be removed from tight, narrow spaces. In such problems, the distance to the environment is often on th…
Locating and intercepting a moving target from possibly delayed, intermittent sensory signals is a paradigmatic problem in decision-making under uncertainty, and a fundamental challenge for, e.g., ani…
Federated Learning (FL) enables collaborative model training across distributed clients without sharing raw data, thereby preserving privacy. However, FL often suffers from significant communication a…
We give a necessary and sufficient condition on a matrix for its centralizer in $\sf{GL}(n,\mathbb{Z})$ to be polycyclic, or equivalently in this case, not to contain a non-abelian free subgroup. We g…
Large Language Models (LLMs) have achieved remarkable progress across reasoning, generation, and decision-making tasks, yet deploying them on mobile, embedded, and edge devices remains particularly ch…
The main result of this paper shows that almost all graphs of order $n$ have no cospectral mates with height $o(( n / \ln n)^{1/10})$, improving an earlier result on cospectral mates with fixed level …
Foraging is a central decision-making behavior performed by all animals, essential to garnishing enough energy for an organism to survive. Similarly, mating is crucial for evolutionary continuity and …
In this work, we propose a zero constellation for binary modulation on conjugate-reciprocal zeros (BMOCZ), called jutted BMOCZ (J-BMOCZ), and study its application to non-coherent orthogonal frequency…
Free open-access publishing with Google Scholar indexing.
Submission Guide →