4,735+ open-access research outputs.
We study solution discovery, where the goal is to obtain a feasible solution to a problem from an initial configuration by a bounded sequence of local moves. In many applications, however, the graph t…
Let $P\subset\mathbb R^n$ be a convex polytope and let $\ell$ be a linear functional which is nonconstant on every edge of $P$. The induced acyclic orientation determines positive and negative Bia{\l}…
We introduce root-to-leaf path random walks on double covers of graded signed graphs and analyze their behavior in a general setting. Viewing simplicial complexes within this framework, we show that t…
We consider a path-dependent Hamilton--Jacobi equation with coinvariant derivatives over the space of continuous functions. We prove two uniqueness results for viscosity (generalized) solutions define…
We study Chebyshev quotients that arise in the representation theory of Lie algebras, specifically within the theory of Demazure flags for fusion products of $\mathfrak{sl}_2[t]$-modules. Motivated by…
Recently, Arag\~{a}o, Marciano, and Mendon\c{c}a [\emph{European J. Combin.}, 2025] conjectured that for any graph $G$ on $n$ vertices satisfying $(r-1)(t-1)k < n \le (r-1)(t-1)(k+1)$, the minimum deg…
We prove an integral formula for the spectral flow of differentiable loops of unitaries of the form ${\rm Id}+$Schatten. Our formula is in terms of a regularised winding number, expressed in terms of …
We address a short-wave asymptotic for one class of quasi-linear second order PDE systems involving the cross-diffusion described by the so-called Patlak--Keller--Segel law. It is common to employ the…
We introduce a colorful version of separating path systems, in which two edges can only be separated from each other by two paths of distinct colors. We calculate the minimum sizes of such systems for…
The online Ramsey game for graphs $G$ and $H$ is played on the infinite complete graph $K_\mathbb{N}$. Each round, Builder chooses an edge, and Painter colors it red or blue. The online Ramsey number …
We provide an end-to-end workflow to rigorously compute the monodromy of Belyi maps from exact equations over number fields using certified homotopy continuation. We then apply this method at scale to…
We characterize which local matrix structures saturate Weyl's eigenvalue perturbation bound for graph Laplacians under geometrically constrained vertex displacements. Geometric graphs with heavy-taile…
In this paper, we consider a two-parameter ($l$ and $a$) generalization of a sequence that Glasby and Paseman considered. Based on computer experiments, we conjecture its unimodality, log-concavity, p…
A criterion for proving a strong form of propagation of chaos on the path space, known as entropy chaos, for a general interacting diffusion system is proposed. Our analysis focuses on the class of co…
Path geometries provide a geometric encoding of systems of second order ODE, which serves as a model for the geometric theory of more general systems of ODE and for cone structures. They are an instan…
Path-planning for autonomous vehicles in threat-laden environments is a fundamental challenge. While traditional optimal control methods can find ideal paths, the computational time is often too slow …
We provide exact formulas for the depth of the quotient ring of powers of the edge ideal of an increasing weighted path.…
Addressing a question posed by Erd\H{o}s and Hajnal, Chen and Ma proved that, for all $n \ge 600$, the complete bipartite graph $K_{n,n+1}$ is the unique graph on $2n+1$ vertices with at least $n^2+n$…
Let $P_k$ denote the path with $k$ vertices, and $\mathrm{ex}_{\mathcal{OP}}(n,H^{\mathrm{ind}},\emptyset)$ be the maximum number of induced copies of $H$ in an $n$-vertex outerplanar graph. In this p…
This addendum extends prior work to the non-regular setting by introducing the tame realization of a precubical set as a multipointed $d$-space. Its execution paths are precisely the nonconstant tame …
Free open-access publishing with Google Scholar indexing.
Submission Guide →