1,750+ open-access research outputs.
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…
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…
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…
Undergraduates in work-based learning experiences often produce meaningful contributions as viewed by their supervisors, yet report a negative perception of their contributions because they struggled …
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…
AI coding assistants have proliferated rapidly, yet structured pedagogical frameworks for learning these tools remain scarce. Developers face a gap between tool documentation and practical mastery, re…
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…
Gromov's theorem states that a finitely generated group has polynomial growth if and only if it is virtually nilpotent. A key ingredient in its proof is the small doubling property. In this work, we s…
Given two hypergraphs $G$ and $H$, the weak saturation number $\operatorname{\mathrm{wsat}}(G,H)$ is the minimum number of edges in a spanning subhypergraph $F$ of $G$ such that the missing edges of $…
Diffusion language models have seen exciting recent progress, offering far more flexibility in generative trajectories than autoregressive models. This flexibility has motivated a growing body of rese…
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 …
In this paper we discuss some results regarding the rigidity of the Borell-Brascamp-Lieb inequality and the Brunn-Minkowski inequality. We show a theorem of rigidity on curvature and measure of the Bo…
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 …
Randomstrasse101 is a blog dedicated to Open Problems in Mathematics, with a focus on Probability Theory, Computation, Combinatorics, Statistics, and related topics. This manuscript serves as a stable…
We study the minimum degree threshold $\delta_{r,q}$ guaranteeing the existence of $K_r$-tilings of high discrepancy in any $q$-edge-coloring. Balogh, Csaba, Pluh\'ar and Treglown handled the 2-color …
For a non-decreasing sequence $S = (s_1, s_2, \ldots, s_k)$ of positive integers, a packing $S$-coloring of a graph $G$ is a partition of $V(G)$ into $V_1, V_2, \ldots, V_k$ such that each $V_i$ has p…
A randomly perturbed graph $G^p = G_\alpha \cup G_{n,p}$ is obtained by taking a deterministic $n$-vertex graph $G_\alpha = (V, E)$ with minimum degree $\delta(G)\geq \alpha n$ and adding the edges of…
In 1992, Bollob\'as and Meir showed that for every $k \geq 1$ there exists a constant $c_k$ such that, for any $n$ points in the $k$-dimensional unit cube $[0, 1]^k$, one can find a tour $x_1, \dots, …
Free open-access publishing with Google Scholar indexing.
Submission Guide →