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

We generalize several classical theorems in extremal combinatorics by replacing a global constraint with an inequality which holds for all objects in a given class. In particular we obtain generalizations of Tur\'an's theorem, the…

Assuming the Riemann Hypothesis, we obtain asymptotic formulas for the average number representations of an even integer as the sum of two primes. We use the method of Bhowmik and Schlage-Puchta and refine their results slightly to obtain a…

Generalized Zeckendorf decompositions are expansions of integers as sums of elements of solutions to recurrence relations. The simplest cases are base-$b$ expansions, and the standard Zeckendorf decomposition uses the Fibonacci sequence.…

This paper deals with the problem of graph matching or network alignment for Erd\H{o}s--R\'enyi graphs, which can be viewed as a noisy average-case version of the graph isomorphism problem. Let $G$ and $G'$ be $G(n, p)$ Erd\H{o}s--R\'enyi…

A central problem in extremal graph theory is to estimate, for a given graph $H$, the number of $H$-free graphs on a given set of $n$ vertices. In the case when $H$ is not bipartite, fairly precise estimates on this number are known. In…

We study a generalization of the Erd\H{o}s-Falconer distance problem over finite fields. For a graph $G$, two embeddings $p, p': V(G) \to \mathbb{F}_q^d$ of a graph $G$ are congruent if for all edges $(v_i, v_j)$ of $G$ we have that…

Denote by $G=(V,E)$ a finite graph. We study a generalized Chern-Simons equation $$ \Delta u=\lambda \mathrm{e}^u(\mathrm{e}^{bu}-1)+4\pi\sum\limits_{j=1}^{N}\delta_{p_j} $$ on $G$, where $\lambda$ and $b$ are positive constants; $N$ is a…

We use new bounds of double exponential sums with ratios of integers from prescribed intervals to get an asymptotic formula for the number of solutions to congruences $$ \sum_{j=1}^n a_j x_jy_j^{-1} \equiv a_0 \pmod p, $$ with variables…

Consider a finite connected graph denoted as $G=(V, E)$. This study explores a generalized Chern-Simons Higgs model, characterized by the equation: $$ \Delta u = \lambda e^u (e^u - 1)^{2p+1} + f,$$ where $\Delta$ denotes the graph…

For the word $\omega = \underbrace{11\ldots 1}_{x_1}\underbrace{22\ldots2}_{x_2}\ldots\underbrace{nn\ldots n}_{x_n},$ denote by $\mathsf{A}(x_1, x_2, \ldots, x_n)$ the number of its anagrams without fixed letters. While the function…

Let $$\gamma^*=\frac{8}{9}+\frac{2}{3}\:\frac{\log(10/9)}{\log 10}\:(\approx 0.919\ldots)\:.$$ Let $\gamma^*<\gamma_0\leq 1$, $c_0=1/\gamma_0$ be fixed. Let also $a_0\in\{0,1,\ldots, 9\}$.\\ We prove on assumption of the Generalized Riemann…

A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…

The chromatic polynomial of a graph is an important notion in algebraic combinatorics that was introduced by Birkhoff in 1912; denoted $P(G,k)$, it equals the number of proper $k$-colorings of graph $G$. Enumerative analogues of the…

We consider the one-dimensional nonlinear Schr\"odinger equation $$ iu_t + u_{xx} + \mathcal{N}(u)u=0, \quad x,t \in \mathbb R, $$ with the nonlinearity term that is expressed as a sum of powers, possibly infinite: $$ \mathcal{N}(u) = \sum…

Estimating the discrepancy of the hypergraph of all arithmetic progressions in the set $[N]=\{1,2,\hdots,N\}$ was one of the famous open problems in combinatorial discrepancy theory for a long time. An extension of this classical hypergraph…

Let $T(G;X,Y)$ be the Tutte polynomial for graphs. We study the sequence $t_{a,b}(n) = T(K_n;a,b)$ where $a,b$ are non-negative integers, and show that for every $\mu \in \N$ the sequence $t_{a,b}(n)$ is ultimately periodic modulo $\mu$…

In this paper, we study a combinatorial problem originating in the following conjecture of Erdos and Lemke: given any sequence of n divisors of n, repetitions being allowed, there exists a subsequence the elements of which are summing to n.…

We consider the Schr\"odinger operator on a combinatorial graph consisting of a finite graph and a finite number of discrete half-lines, all jointed together, and compute an asymptotic expansion of its resolvent around the threshold $0$.…

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_{\nu}+s)\equiv (y_1+s)...(y_{\nu}+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications…

In this paper we prove an asymptotic formula for the number of solutions in prime numbers to systems of simultaneous linear inequalities with algebraic coefficients. For $m$ simultaneous inequalities we require at least $m+2$ variables,…