相关论文: On a conjecture of Knuth about forward and back ar…

Recently, S. Li and A. Pott\cite{LP} proposed a new concept of intersection distribution concerning the interaction between the graph $\{(x,f(x))~|~x\in\F_{q}\}$ of $f$ and the lines in the classical affine plane $AG(2,q)$. Later, G.…

The problem of how to estimate diffusion on a graph effectively is of importance both theoretically and practically. In this paper, we make use of two widely studied indices, geodesic distance and mean first-passage time ($MFPT$) for random…

In 1985, Mader conjectured the existence of a function $f$ such that every digraph with minimum out-degree at least $f(k)$ contains a subdivision of the transitive tournament of order $k$. This conjecture is still completely open, as the…

Although Dijkstra's algorithm has near-optimal time complexity for the problem of finding a shortest path from a given vertex $s$ to a given vertex $t$, in practice other algorithms are often superior on huge graphs. A prominent example is…

Discrete trigonometric transformations, such as the discrete Fourier and cosine/sine transforms, are important in a variety of applications due to their useful properties. For example, one well-known property is the convolution theorem for…

We consider the Gaussian curvature conjecture of a minimal graph $S$ over the unit disk. First of all we reduce the general conjecture to the estimating the Gaussian curvature of some Scherk's type minimal surfaces over a quadrilateral…

For a compact set $A$ in $\mathbb{R}^n$ the Hausdorff distance from $A$ to $\text{conv}(A)$ is defined by \begin{equation*} d(A):=\sup_{a\in\text{conv}(A)}\inf_{x\in A}|x-a|, \end{equation*} where for $x=(x_1,\dots,x_n)\in\mathbb{R}^n$ we…

For an oriented graph $D$, the inversion of $X\subseteq V(D)$ in $D$ is the graph obtained by reversing the orientation of all arcs with both ends in $X$. The inversion number $\mathrm{inv}(D)$ is the minimum number of inversions needed to…

A Ferrers rook graph is a graph whose vertices correspond to the dots in a Ferrers diagram, and where two vertices are adjacent if they are in the same row or the same column. We propose a conjectural formula for the gonality of Ferrers…

The paper gives a thorough introduction to spectra of digraphs via its Hermitian adjacency matrix. This matrix is indexed by the vertices of the digraph, and the entry corresponding to an arc from $x$ to $y$ is equal to the complex unity…

The Pruning Front Conjecture is proved for an open set of H\'enon parameters far from unimodal. More specifically, for an open subset of H\'enon parameter space, consisting of two connected components one of which intersects the…

In this paper, we propose a depth-first search (DFS) algorithm for searching maximum matchings in general graphs. Unlike blossom shrinking algorithms, which store all possible alternative alternating paths in the super-vertices shrunk from…

We establish Diophantine inequalities for the fractional parts of generalized polynomials $f$, in particular for sequences $\nu(n)=\lfloor n^c\rfloor+n^k$ with $c>1$ a non-integral real number and $k\in\mathbb{N}$, as well as for $\nu(p)$…

By using techniques of holomorphic jets and Jacobian fields, we devise a non-equidistribution theory of holomorphic curves into complex projective varieties intersecting normal crossing divisors. Based on this theory established, we prove…

Using existing technology, we prove a Masur-Minsky style distance formula for flip- graph distance between two triangulations, expressed as a sum of the distances of the projections of these triangulations into arc graphs of the suitable…

Depth First Search (DFS) tree is a fundamental data structure for solving graph problems. The DFS tree of a graph $G$ with $n$ vertices and $m$ edges can be built in $O(m+n)$ time. Till date, only a few algorithms have been designed for…

In this paper, we study the well-known Kohayakawa-Nagle-R{\"o}dl-Schacht (KNRS) conjecture, with a specific focus on graph subdivisions. The KNRS conjecture asserts that for any graph $H$, locally dense graphs contain asymptotically at…

Let F1 and F2 be independent copies of correlated fractal percolation, with Hausdorff dimensions dimH(F1) and dimH(F2). Consider the following question: does dimH(F1)+dimH(F2)>1 imply that their algebraic difference F1-F2 will contain an…

Let $\Omega\subset\mathbb{R}^n$ be a strictly convex domain with smooth boundary and diameter $D$. The fundamental gap conjecture claims that if $V:\bar\Omega\to\mathbb{R}$ is convex, then the spectral gap of the Schr\"odinger operator…

In the field of statistics, many kind of divergence functions have been studied as an amount which measures the discrepancy between two probability distributions. In the differential geometrical approach in statistics (information…