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

The main result of this announcement is a formula for the tensor product of the class of a homogeneous line bundle with a Schubert class, expressed as a K(X)-linear combination of Schubert classes. We believe that this formula is the most…

In 2021, Chen proved a congruence for the degree of a certain map on the space of covers of elliptic curves. He concluded as a corollary that the size of any connected component of the Markoff mod $p$ graph is divisible by $p$. In…

The recent significant enrichment of the Order Completion Method for nonlinear Systems of PDEs resulted in the global existence of generalized solutions to a large class of such equations. In this paper we investigate the existence and…

A class of generalized Schr\"{o}dinger problems in bounded domain is studied. A complete overview of the set of solutions is provided, depending on the values assumed by parameters involved in the problem. In order to obtain the results, we…

We show that for every integer $n\geq 1$ there exists a graph $G_n$ with $(1+o(1))n$ vertices and $n^{1 + o(1)}$ edges such that every $n$-vertex planar graph is isomorphic to a subgraph of $G_n$. The best previous bound on the number of…

Shnirelman's theorem is applied to solving Diophantine equations, and also discussing of the problems of a representation of Gaussian integers by a sum of odd Gaussian primes.

Let $G$ be a connected graph and $\mathcal{P}(G)$ a graph parameter. We say that $\mathcal{P}(G)$ is feasible if $\mathcal{P}(G)$ satisfies the following properties: (I) $\mathcal{P}(G)\leq \mathcal{P}(G_{uv})$, if $G_{uv}=G[u\to v]$ for…

Let $f(n)$ be the smallest number such that every collection of $n$ matchings, each of size at least $f(n)$, in a bipartite graph, has a full rainbow matching. Generalizing famous conjectures of Ryser, Brualdi and Stein, Aharoni and Berger…

In this paper, we prove a generalization of a conjecture of Erd\"{o}s, about the chromatic number of certain Kneser-type hypergraphs. For integers $n,k,r,s$ with $n\ge rk$ and $2\le s\le r$, the $r$-uniform general Kneser hypergraph…

Let $\lambda$ be the Liouville function. Assuming the Generalised Riemann Hypothesis for Dirichlet $L$-functions (GRH), we show that for every sufficiently large even integer $N$ there are $a,b \geq 1$ such that $$ a+b = N \text{ and }…

A graph $H$ is \emph{common} if the number of monochromatic copies of $H$ in a 2-edge-colouring of the complete graph $K_n$ is asymptotically minimised by the random colouring, or equivalently, $t_H(W)+t_H(1-W)\geq 2^{1-e(H)}$ holds for…

For each positive integer $n$, function $f$, and point $x$, the 1998 conjecture by Ghinchev, Guerragio, and Rocca states that the existence of the $n$-th Peano derivative $f_{(n)}(x)$ is equivalent to the existence of all $n(n+1)/2$…

In this article, we shall generalize a theorem due to Frobenius in group theory, which asserts that if $p$ is a prime and $p^{r}$ divides the order of a finite group, then the number of subgroups of order $p^{r}$ is $\equiv$ 1(mod $p$).…

We present a method for obtaining congruences modulo powers of a prime number~$p$ for combinatorial sequences whose generating function satisfies an algebraic differential equation. This method generalises the one by Kauers and the authors…

A Neumaier graph is a non-complete edge-regular graph containing a regular clique. A Neumaier graph that is not strongly regular is called a strictly Neumaier graph. In this work we present a new construction of strictly Neumaier graphs,…

We give a combinatorial proof of a recent geometric result of Farkas and Lian on linear series on curves with prescribed incidence conditions. The result states that the expected number of degree-$d$ morphisms from a general genus $g$,…

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

In the present paper we prove that under the assumption of the GRH (Generalized Riemann Hypothesis) each sufficiently large odd integer can be expressed as the sum of a prime and two isolated primes.

The famous strongly binary Goldbach's conjecture asserts that every even number $2n \geq 8$ can always be expressible as the sum of two distinct odd prime numbers. We use a new approach to dealing with this conjecture. Specifically, we…

Our result contains as special cases the Frobenius theorem (1895) on the~number of solutions to the equation $x^n=1$ in a finite group and the Solomon theorem (1969) on the number of solutions in a group to systems of equations with fewer…