Related papers: Ultradiscretization of a solvable two-dimensional …
This paper studies the convergence of a spatial semidiscretization of a three-dimensional stochastic Allen-Cahn equation with multiplicative noise. For non-smooth initial data, the regularity of the mild solution is investigated, and an…
This paper presents two approaches to reducing problems on $2$-cycles on a smooth cubic hypersurface $X$ over an algebraically closed field of characteristic $\neq 2$, to problems on $1$-cycles on its variety of lines $F(X)$. The first one…
We investigate spectral quantities of quantum graphs by expanding them as sums over pseudo orbits, sets of periodic orbits. Only a finite collection of pseudo orbits which are irreducible and where the total number of bonds is less than or…
This paper investigates the semi-discrete optimal transport (OT) problem with entropic regularization. We characterize the solution using a governing, well-posed ordinary differential equation (ODE). This naturally yields an algorithm to…
We consider three variants of the problem of finding a maximum weight restricted $2$-matching in a subcubic graph $G$. (A $2$-matching is any subset of the edges such that each vertex is incident to at most two of its edges.) Depending on…
We present a quasi-integrable two-dimensional lattice equation: i.e., a partial difference equation which satisfies a criterion of integrability, singularity confinement, although it has a chaotic aspect in the sense that the degrees of its…
We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are…
In this paper we show the existence of infinitely many symmetric solutions for a cubic Dirac equation in two dimensions, which appears as effective model in systems related to honeycomb structures. Such equation is critical for the Sobolev…
Ultradiscretization with negative values is a long-standing problem and several attempts have been made to solve it. Among others, we focus on the symmetrized max-plus algebra, with which we ultradiscretize the discrete sine-Gordon…
${\cal U}$ntil now the representation (i.e. plotting) of curve in Parallel Coordinates is constructed from the point $\leftrightarrow$ line duality. The result is a ``line-curve'' which is seen as the envelope of it's tangents. Usually this…
We consider the damped hyperbolic motion of polygons by a linear semi-discrete analogue of polyharmonic curve diffusion. We show that such flows may transition any polygon to any other polygon, reminiscent of the Yau problem of evolving one…
In this article, we construct countably many mutually non-isotopic diffeomorphisms of some closed non simply-connected 4-manifolds that are homotopic to but not isotopic to the identity, by surgery along $\Theta$-graphs. As corollaries of…
In this paper, we propose a general framework for sparse and low-rank tensor estimation from cubic sketchings. A two-stage non-convex implementation is developed based on sparse tensor decomposition and thresholded gradient descent, which…
Let $\bar{P}$ be a sequence of length $2n$ in which each element of $\{1,2,...,n\}$ occurs twice. Let $P'$ be a closed curve in a closed surface $S$ having $n$ points of simple auto-intersections, inducing a 4-regular graph embedded in $S$…
We study the quadratic $k$-vertex-disjoint paths problem (Q-$k$-VDP), which seeks $k$ vertex-disjoint paths in a directed graph that minimize a nonconvex quadratic objective function. We formulate the problem as a binary quadratic program…
We analyze the spatially semidiscrete piecewise linear finite element method for a nonlocal parabolic equation resulting from thermistor problem. Our approach is based on the properties of the elliptic projection defined by the bilinear…
The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…
In the first part of the paper, we classify linear integrable (multi-dimensionally consistent) quad-equations on bipartite isoradial quad-graphs in $\mathbb C$, enjoying natural symmetries and the property that the restriction of their…
As a model problem for clustering, we consider the densest k-disjoint-clique problem of partitioning a weighted complete graph into k disjoint subgraphs such that the sum of the densities of these subgraphs is maximized. We establish that…
Multi-layer graphs consist of several graphs (layers) over the same vertex set. They are motivated by real-world problems where entities (vertices) are associated via multiple types of relationships (edges in different layers). We chart the…