Related papers: A note on a recent attempt to solve the second par…

Denote by $u(n)$ the largest principal specialization of the Schubert polynomial: $ u(n) := \max_{w \in S_n} \mathfrak{S}_w(1,\ldots,1) $ Stanley conjectured in [arXiv:1704.00851] that there is a limit $\lim_{n\to \infty} \, \frac{1}{n^2}…

A method for generating irreducible polynomials of degree n over the finite field GF(2) is proposed. The irreducible polynomials are found by solving a system of equations that brings the information on the internal properties of the…

The main purpose of this paper is to study limit cycles in non-linear regularizations of planar piecewise smooth systems with fold points (or more degenerate tangency points) and crossing regions. We deal with a slow fast Hopf point after…

Let $\{u_n\}_n$ be a non-degenerate linear recurrence sequence of integers with Binet's formula given by $u_n= \sum_{i=1}^{m} P_i(n)\alpha_i^n.$ Assume $\max_i \vert \alpha_i \vert >1$. In 1977, Loxton and Van der Poorten conjectured that…

For a bilinear map $*:\mathbb R^d\times \mathbb R^d\to \mathbb R^d$ of nonnegative coefficients and a vector $s\in \mathbb R^d$ of positive entries, among an exponentially number of ways combining $n$ instances of $s$ using $n-1$…

We examine possibility to design an efficient solving algorithm for problems of the class \np. It is introduced a classification of \np problems by the property that a partial solution of size $k$ can be extended into a partial solution of…

It is known that non-hyperbolic limit cycles are structurally unstable in the set of planar smooth and analytical vector fields. In the polynomial case, it is known only that limit cycles of even degree are structurally unstable. In this…

Finding general conditions which ensure that a graph is Hamiltonian is a central topic in graph theory. An old and well known conjecture in the area states that any $d$-regular $n$-vertex graph $G$ whose second largest eigenvalue in…

In this paper, we study the extremal behaviour of deep holes in polyominoes. We determine the maximum number, $h_n$ of deep holes that an $n$-omino can enclose, ensuring that the boundary of each hole is disjoint from the boundaries of any…

The $\textit{planar Tur\'an number}$ $\textrm{ex}_{\mathcal P}(n,H)$ of a graph $H$ is the maximum number of edges in an $n$-vertex planar graph without $H$ as a subgraph. Let $C_{\ell}$ denote the cycle of length $\ell$. The planar Tur\'an…

We give an upper bound in O(d ^((n+1)/2)) for the number of critical points of a normal random polynomial with degree d and at most n variables. Using the large deviation principle for the spectral value of large random matrices we obtain…

This paper examines bounds on upper tails for cycle counts in $G_{n,p}$. For a fixed graph $H$ define $\xi_H= \xi_H^{n,p}$ to be the number of copies of $H$ in $G_{n,p}$. It is a much studied and surprisingly difficult problem to understand…

In this paper, we perturb the global center of the planar polynomial vector fields $\mathcal{X}(x,y)=(-y(x^2+a^2),x(x^2+a^2))$ ($a\neq0$) inside cubic piecewise smooth polynomials with switching line $y=0$. By using average function of…

The present work contributes to the determination of the $n$-th linear polarization constant $c_n(H)$ of an $n$-dimensional real Hilbert space $H$. We provide some new lower bounds on the value of $\sup_{\|y\|=1}| x_1,y >... x_n,y |$, where…

A well-known result of Ajtai et al. from 1982 states that every $k$-graph $H$ on $n$ vertices, with girth at least five, and average degree $t^{k-1}$ contains an independent set of size $c n (\log t)^{1/(k-1)}/t$ for some $c>0$. In this…

We study two variants of the notion of holes formed by planar simple random walk of time duration $2n$ and the areas associated with them. We prove in both cases that the number of holes of area greater than $A(n)$, where $\{A(n)\}$ is an…

For each $n$, let $\text{RD}(n)$ denote the minimum $d$ for which there exists a formula for the general polynomial of degree $n$ in algebraic functions of at most $d$ variables. In 1945, Segre called for a better understanding of the large…

Let $q\geqslant 2$ be a fixed prime power. We prove an asymptotic formula for counting the number of monic polynomials that are of degree $n$ and have exactly $k$ irreducible factors over the finite field $\mathbb{F}_q$. We also compare our…

Let $H_D(T)$ denote the Hilbert class polynomial of the imaginary quadratic order of discriminant $D$. We study the rate of growth of the greatest common divisor of $H_D(a)$ and $H_D(b)$ as $|D| \to \infty$ for $a$ and $b$ belonging to…

An edge-coloured graph is said to be rainbow if no colour appears more than once. Extremal problems involving rainbow objects have been a focus of much research over the last decade as they capture the essence of a number of interesting…