相关论文: Turan Extremum Problem for Periodic Function with …

Inspired by the work of Karamata, we consider an extremization problem associated with the probability of intersecting two random chords inside a circle of radius $r, \, r \in (0,1]$, where the endpoints of the chords are drawn according to…

We develop foundational tools for classifying the extreme valid functions for the k-dimensional infinite group problem. In particular, (1) we present the general regular solution to Cauchy's additive functional equation on bounded convex…

Given a graph $H$ and a positive integer $n$, the {\it Tur\'an number} $\ex(n,H)$ is the maximum number of edges in an $n$-vertex graph that does not contain $H$ as a subgraph. A real number $r\in(1,2)$ is called a {\it Tur\'an exponent} if…

Combinatorial batch codes provide a tool for distributed data storage, with the feature of keeping privacy during information retrieval. Recently, Balachandran and Bhattacharya observed that the problem of constructing such uniform codes in…

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 provide a uniform bound on the partial sums of multiplicative functions under very general hypotheses. As an application, we give a nearly optimal estimate for the count of $n \le x$ for which the Alladi-Erd\H{o}s function $A(n) =…

We propose new estimates for the frontier of a set of points. They are defined as kernel estimates covering all the points and whose associated support is of smallest surface. The estimates are written as linear combinatio- ns of kernel…

We study the following question: Given an open set $\Omega$, symmetric about 0, and a continuous, integrable, positive definite function $f$, supported in $\Omega$ and with $f(0)=1$, how large can $\int f$ be? This problem has been studied…

The main purpose of this paper is to determine all normalized extremal quasimodular forms of depth 1 whose Fourier coefficients are integers. By changing the local parameter at infinity from $q=e^{2\pi i \tau}$ to the reciprocal of the…

Tur\'an number is one of primary topics in the combinatorics of finite sets,in this paper, we will present a new upper bound for Tur\'an number.

Submodular functions describe a variety of discrete problems in machine learning, signal processing, and computer vision. However, minimizing submodular functions poses a number of algorithmic challenges. Recent work introduced an…

Erd\H{o}s and Tur\'an proved a classical inequality on the distribution of roots for a complex polynomial in 1950, depicting the fundamental interplay between the size of the coefficients of a polynomial and the distribution of its roots on…

In this paper we formulate and solve extremal problems in the d-dimensional Euclidean space and further in hypergraphs, originating from problems in stoichiometry and elementary linear algebra. The notion of affine simplex is the bridge…

Convolution with an appropriate surface measure on a paraboloid is known to define a bounded operator T from L^p(R^d) to L^q(R^d) for certain exponents p,q. By a quasiextremal for the associated inequality, we mean a function f for which…

We address a problem which is a generalization of Tur\'an-type problems recently introduced by Imolay, Karl, Nagy and V\'ali. Let $F$ be a fixed graph and let $G$ be the union of $k$ edge-disjoint copies of $F$, namely $G =…

Under general multivariate regular variation conditions, the extreme Value-at-Risk of a portfolio can be expressed as an integral of a known kernel with respect to a generally unknown spectral measure supported on the unit simplex. The…

We prove a generalised Ramsey--Tur\'an theorem for matchings, which (a) simultaneously generalises the Cockayne--Lorimer Theorem (Ramsey for matchings) and the Erd\H{o}s--Gallai Theorem (Tur\'an for matchings), and (b) is a generalised…

The Tur\'an type extremal problem asks to maximize the number of edges over all graphs which do not contain fixed subgraphs. Similarly, the spectral Tur\'an type extremal problem asks to maximize spectral radius of all graphs which do not…

The present paper is a continuation of the author's previous works, in which necessary and sufficient local extrema at a stationary point of a polynomial or a power series (and thus of an analytic function) are given. It is known that for…

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…