Related papers: Tur\'{a}n problems for multilinear maps

We systematically introduce an approach to the analysis and (numerical) solution of a broad class of nonlinear unconstrained optimal control problems, involving ordinary and distributed systems. Our approach relies on exact representations…

Parameter-elliptic boundary-value problems are investigated on the extended Sobolev scale. This scale consists of all Hilbert spaces that are interpolation spaces with respect to the Hilbert Sobolev scale. The latter are the H\"ormander…

We give new upper bounds for the number of nonconstant holomorphic maps depending only on the genus. Our estimates improve previously known bounds. The proof is based on the study of pullbacks of holomorphic differentials, together with…

We show that the discrete Sinkhorn algorithm - as applied in the setting of Optimal Transport on a compact manifold - converges to the solution of a fully non-linear parabolic PDE of Monge-Ampere type, in a large-scale limit. The latter…

For a graph $G$ whose degree sequence is $d_{1},..., d_{n}$, and for a positive integer $p$, let $e_{p}(G)=\sum_{i=1}^{n}d_{i}^{p}$. For a fixed graph $H$, let $t_{p}(n,H)$ denote the maximum value of $e_{p}(G)$ taken over all graphs with…

Given $r$-uniform hypergraphs $G$ and $H$ the Tur\'an number $\rm ex(G, H)$ is the maximum number of edges in an $H$-free subgraph of $G$. We study the typical value of $\rm ex(G, H)$ when $G=G_{n,p}^{(r)}$, the Erd\H{o}s-R\'enyi random…

In this paper, the $mn$-dimensional space of tensor-product polynomials of two variables, of degree at most $(m-1)+(n-1)$, is considered. A theory of two-variate polynomials is developed by establishing the algebra and basic algebraic…

For two $s$-uniform hypergraphs $H$ and $F$, the Tur\'{a}n number $ex_s(H,F)$ is the maximum number of edges in an $F$-free subgraph of $H$. Let $s, r, k, n_1, \ldots, n_r$ be integers satisfying $2\leq s\leq r$ and $n_1\leq n_2\leq…

Given $p\geq 0$ and a graph $G$ whose degree sequence is $d_1,d_2,\ldots,d_n$, let $e_p(G)=\sum_{i=1}^n d_i^p$. Caro and Yuster introduced a Tur\'an-type problem for $e_p(G)$: given $p\geq 0$, how large can $e_p(G)$ be if $G$ has no…

Let $E$ be an elliptic curve defined over $\mathbb{Q}$, and let $\mathbb{Q}^{ab}$ be the maximal abelian extension of $\mathbb{Q}$. In this article we classify the groups that can arise as $E(\mathbb{Q}^{ab})_{\text{tors}}$ up to…

For integers $k, \ell \geq 3$, let $\mathrm{ex}(n, \overrightarrow{C_k}, \overrightarrow{C_\ell})$ denote the maximum number of directed cycles of length $k$ in any oriented graph on $n$ vertices which does not contain a directed cycle of…

Let $n \ge 5$ and $k\ge 4$ be positive integers. We determine the maximum size of digraphs of order n that avoid distinct walks of length k with the same endpoints. We also characterize the extremal digraphs attaining this maximum number…

Tropical geometry and the theory of Newton-Okounkov bodies are two methods which produce toric degenerations of an irreducible complex projective variety. Kaveh-Manon showed that the two are related. We give geometric maps between the…

An ordered hypergraph is a hypergraph $G$ whose vertex set $V(G)$ is linearly ordered. We find the Tur\'an numbers for the $r$-uniform $s$-vertex tight path $P^{(r)}_s$ (with vertices in the natural order) exactly when $r\le s < 2r$ and $n$…

In this paper we first introduce an innovative equivalent norm in the Musielak-Orlicz Sobolev spaces in a very general setting and we then present a new result on the boundedness of the solutions of a wide class of nonlinear Neumann…

The planar Tur\'an number of a graph $H$, denoted $ex_{_\mathcal{P}}(n,H)$, is the maximum number of edges in a planar graph on $n$ vertices without containing $H$ as a subgraph. This notion was introduced by Dowden in 2016 and has…

In the present paper we use twistor theory in order to solve two problems related to harmonic maps from surfaces to Euclidean spheres $\mathbb{S}^n$. First, we propose a new approach to isoperimetric inequalities based on energy index.…

The problem of computing an exact experimental design that is optimal for the least-squares estimation of the parameters of a regression model is considered. We show that this problem can be solved via mixed-integer linear programming…

The oriented Tur\'{a}n number of a given oriented graph $\overrightarrow{F}$, denoted by $\exo(n,\overrightarrow{F})$, is the largest number of arcs in $n$-vertex $\overrightarrow{F}$-free oriented graphs. This parameter could be seen as a…

The Gromov--Wasserstein problem is a non-convex optimization problem over the polytope of transportation plans between two probability measures supported on two spaces, each equipped with a cost function evaluating similarities between…