相关论文: A generalization of Sch\"{o}nemann's theorem via a…

We propose a systematic method for analyzing Rohrlich-type divisor sums for arbitrary congruence subgroups $\Gamma_0(N)$. Our main theorem unifies various results from the literature, and its significance is illustrated through the…

Let $$\gamma^*:=\frac{8}{9}+\frac{2}{3}\:\frac{\log(10/9)}{\log 10}\:(\approx 0.919\ldots)\:,\ \gamma^*<\frac{1}{c_0}\leq 1\:.$$ Let $\gamma^*<\gamma_0\leq 1$, $c_0=1/\gamma_0$ be fixed. Let also $a_0\in\{0,1,\ldots, 9\}$. In [23] we proved…

Motivated by applications in combinatorial geometry, we consider the following question: Let $\lambda=(\lambda_1,\lambda_2,\ldots,\lambda_m)$ be an $m$-partition of a positive integer $n$, $S_i \subseteq \mathbb{C}^{\lambda_i}$ be finite…

A fundamental and challenging problem in spectral graph theory is to characterize which graphs are uniquely determined by their spectra. In Wang [J. Combin. Theory, Ser. B, 122 (2017): 438-451], the author proved that an $n$-vertex graph…

This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…

We prove a generalised Ramsey--Tur\'an theorem for matchings, which (a) simultaneously generalises the Cockayne--Lorimer Theorem (Ramsey for matchings) and the Erd\H{o}s--Gallai Theorem (Tur\'an for matchings), and (b) is a generalised…

We study the joint distribution of the solutions to the equation $gh=x$ in $G(\mathbb{F}_p)$ as $p\to\infty$, for any fixed $x\in G(\mathbb{Z})$, where $G=\operatorname{GL}_n$, $\operatorname{SL}_n$, $\operatorname{Sp}_{2n}$ or…

In graph theory, the Szemer\'edi regularity lemma gives a decomposition of the indicator function for any graph $G$ into a structured component, a uniform part, and a small error. This result, in conjunction with a counting lemma that…

Consider a graph with n nodes and m edges, independent edge weights and lengths, and arbitrary distance demands for node pairs. The spanner problem asks for a minimum-weight subgraph that satisfies these demands via sufficiently short paths…

We review known linear and matrix generalizations of Hall's classic ``marriage theorem'' and K\H{o}nig's theorem on partial matchings in bipartite graphs, and relate them to linear and matrix generalizations of Dilworth's theorem about…

As an application of Szemeredi's regularity lemma, Erdos-Frankl-Rodl (1986) showed that the number of graphs on vertex set {1,2,...n} with a monotone class P is $2^{(1+o(1))ex(n,P)n^2/2}$ where $ex(n,P)$ is the maximum number of edges of an…

For a fixed rational number g, not equal to -1,0 or 1 and integers a and d we consider the set of primes p for which the order of g(mod p) is congruent to a(mod d). For d=4 and d=3 it is shown that, under the Generalized Riemann Hypothesis,…

Many applications in graph theory are motivated by routing or flow problems. Among these problems is Steiner Orientation: given a mixed graph G (having directed and undirected edges) and a set T of k terminal pairs in G, is there an…

One of the classical line of work in graph algorithms has been the Replacement Path Problem: given a graph $G$, $s$ and $t$, find shortest paths from $s$ to $t$ avoiding each edge $e$ on the shortest path from $s$ to $t$. These paths are…

In this short survey article, we present an elementary, yet quite powerful, method of enumerating independent sets in graphs. This method was first employed more than three decades ago by Kleitman and Winston and has subsequently been used…

The main purpose of this note is to establish an effective version of the Grunwald--Wang Theorem, which asserts that given a family of local characters $\chi^{v}$ of $K_{v}^{*}$ of exponent $m$ where $v \in S$ for a finite set $S$ of primes…

In this paper we investigate the $L^p$ regularity, $L^p$ Neumann and $W^{1,p}$ problems for generalized Schr\"odinger operator $-\text{div}(A\nabla )+ V $ in the region above a Lipschitz graph under the assumption that $A$ is elliptic,…

Under the assumption of the existence of Stahl's $S$-compact set we give a short proof of the limit zeros distribution of Pad\'e polynomials and convergence in capacity of diagonal Pad\'e approximants for a generic class of algebraic…

We show that Li's criterion equivalent to the Riemann hypothesis, viz. the statement that the sums k_n=Sum_rho(1-(1-1/rho)^n) over Riemann xi-function zeroes as well as all derivatives lambda_n=…

A new general decomposition theory inspired from modular graph decomposition is presented. This helps unifying modular decomposition on different structures, including (but not restricted to) graphs. Moreover, even in the case of graphs,…