相关论文: Relation between Tur\'an extremum problem and van …

For any compact set $K\subset \mathbb{R}^n$ we develop the theory of Jensen measures and subharmonic peak points, which form the set $\mathcal{O}_K$, to study the Dirichlet problem on $K$. Initially we consider the space $h(K)$ of functions…

We generalize several comparison results between algebraic, semi-topological and topological K-theories to the equivariant case with respect to a finite group.

We study the following question posed by Turan. Suppose K is a convex body in Euclidean space which is symmetric with respect to the origin. Of all positive definite functions supported in K, and with value 1 at the origin, which one has…

The covariogram $g_{K}$ of a convex body $K$ in $\mathbb{R}^n$ is the function which associates to each $x\in\mathbb{R}^n$ the volume of the intersection of $K$ with $K+x$. Determining $K$ from the knowledge of $g_K$ is known as the…

In 1939 P\'al Tur\'an and J\'anos Er\H{o}d initiated the study of lower estimations of maximum norms of derivatives of polynomials, in terms of the maximum norms of the polynomials themselves, on convex domains of the complex plane. As a…

Using an approach to the Jacobian Conjecture by L.M. Dru\.zkowski and K. Rusek 12], G. Gorni and G. Zampieri [19], and A.V. Yagzhev[27], we describe a correspondence between finite dimensional symmetric algebras and homogeneous tuples of…

Let $\mathcal{H}$ be a family of graphs. The generalized Tur\'an number $ex(n, K_r, \mathcal{H})$ is the maximum number of copies of the clique $K_r$ in any $n$-vertex $\mathcal{H}$-free graph. In this paper, we determine the value of…

Let $A$ be an augmented differential graded algebra over a field $k$ of characteristic zero, and let $A^!=\mathbf{R}\mathrm{Hom}_A(k,k)$ be its Koszul dual algebra. Blumberg and Mandell showed that, under some finiteness conditions of $A$,…

A multidimensional extremal problem in the idempotent algebra setting is considered which consists in minimizing a nonlinear functional defined on a finite-dimensional semimodule over an idempotent semifield. The problem integrates two…

We combine two generalizations of ordinary Tur\'an problems. Given graphs $H$ and $F$ and a positive integer $n$, we study $rex(n, H, F )$, which is the largest number of copies of $H$ in $F$-free regular $n$-vertex graphs.

For a simple graph $F$, let $\mathrm{EX}(n, F)$ and $\mathrm{EX_{sp}}(n,F)$ be the set of graphs with the maximum number of edges and the set of graphs with the maximum spectral radius in an $n$-vertex graph without any copy of the graph…

Following P. Fenton, we investigate sum of translates functions $F(\mathbf{x},t):=J(t)+\sum_{j=1}^n \nu_j K(t-x_j)$, where $J:[0,1]\to {\underline{\mathbb{R}}}:=\mathbb{R}\cup\{-\infty\}$ is a "sufficiently non-degenerate" and upper-bounded…

Let G be a locally compact abelian group (LCA group) and U be an open, 0-symmetric set. Let F:=F(U) be the set of all real valued continuous functions from G to R which are supported in U and are positive definite. The Turan constant T(U)…

Here we consider the hypergraph Tur\'an problem in uniformly dense hypergraphs as was suggested by Erd\H{o}s and S\'os. Given a $3$-graph $F$, the uniform Tur\'an density $\pi_u(F)$ of $F$ is defined as the supremum over all $d\in[0,1]$ for…

Determining the Tur\'an densities of hypergraphs is a notoriously difficult problem at the core of combinatorics. Although Tur\'an posed this problem in 1941, $\pi(K_{\ell}^{(k)})$ remains unknown for all $\ell>k\geq 3$. Prior to this work,…

For a fixed polynomial $\Delta$, we study the number of polynomials $f$ of degree $n$ over $\mathbb F_q$ such that $f$ and $f+\Delta$ are both irreducible, an $\mathbb F_q[T]$-analogue of the twin primes problem. In the large-$q$ limit, we…

We present a solution to the real multidimensional rational K-moment problem, where K is defined by finitely many polynomial inequalities. More precisely, let S be a finite set of real polynomials in X=(X_1,...,X_n) such that the…

Let $E$ be a Jordan rectifiable curve in the complex plane and let $G$ be the bounded component of $\mathbb{C}\backslash E$. Now let $n\in \mathbb{N}$, and let $m_{n,E}$ denote the extremal constants defined by \begin{equation*}m_{n,E}=\inf…

Given a graph $T$ and a family of graphs $\mathcal{F}$, the generalized Tur\'an number $\mathrm{ex}(n,T,\mathcal{F})$ is the maximum number of copies of $T$ in an $n$-vertex $\mathcal{F}$-free graph. We prove a general theorem which states…

The Tur\'an number of a graph $H$, denoted by $ex(n, H)$, is the maximum number of edges in any graph on $n$ vertices containing no $H$ as a subgraph. Let $P_{\ell}$ denote the path on $\ell$ vertices, $S_{\ell-1}$ denote the star on $\ell$…