相关论文: Optimal inequalities and extremal problems on the …

We estimate the number of integer solutions to decomposable form inequalities (both asymptotic estimates and upper bounds are provided) when the degree of the form and the number of variables are relatively prime. These estimates display…

We study a general class of convex submodular optimization problems with indicator variables. Many applications such as the problem of inferring Markov random fields (MRFs) with a sparsity or robustness prior can be naturally modeled in…

We suggest a general oracle-based framework that captures different parallel stochastic optimization settings described by a dependency graph, and derive generic lower bounds in terms of this graph. We then use the framework and derive…

We prove the global classical solvability of initial-boundary problems for semilinear first-order hyperbolic systems subjected to local and nonlocal nonlinear boundary conditions. We also establish lower bounds for the order of nonlinearity…

Let $G=(V,E)$ be a finite simple graph. The Sombor index $SO(G)$ of $G$ is defined as $\sum_{uv\in E(G)}\sqrt{d_u^2+d_v^2}$, where $d_u$ is the degree of vertex $u$ in $G$. In this paper, we study this index for certain graphs and we…

For a graph $G$, the first multiplicative Zagreb index $\prod_1$ is equal to the product of squares of the vertex degrees, and the second multiplicative Zagreb index $\prod_2$ is equal to the product of the products of degrees of pairs of…

Modern large-scale statistical models require to estimate thousands to millions of parameters. This is often accomplished by iterative algorithms such as gradient descent, projected gradient descent or their accelerated versions. What are…

The Sombor index of a graph $G$ was recently introduced by Gutman from the geometric point of view, defined as $SO(G)=\sum_{uv\in E(G)}\sqrt{d(u)^2+d(v)^2}$, where $d(u)$ is the degree of a vertex $u$. For two real numbers $\alpha$ and…

Graph operations are crucial for building complicated network architectures from simple graphs. In [7], authors defined two new variants of Corona product and investigated some topological indices. In this paper, we extended the work and…

Many mathematical models involve input parameters, which are not precisely known. Global sensitivity analysis aims to identify the parameters whose uncertainty has the largest impact on the variability of a quantity of interest (output of…

Initial-boundary value problems on a half-strip with different types of boundary conditions for the generalized Kawahara-Zakharov-Kuznetsov equation with nonlinearity of higher order are considered. In particular, nonlinearity can be…

We consider two recent conjectures of Harrington, Henninger-Voss, Karhadkar, Robinson and Wong concerning relationships between the sum index, difference index and exclusive sum number of graphs. One conjecture posits an exact relationship…

For a graph $G$, the first multiplicative Zagreb index $\prod_1(G) $ is the product of squares of vertex degrees, and the second multiplicative Zagreb index $\prod_2(G) $ is the product of products of degrees of pairs of adjacent vertices.…

We determine the degree sequence of the generalized Sierpinski graph and its general first Zagreb index in terms of the same parameters of the base graph G.

We study a general class of convex submodular optimization problems with indicator variables. Many applications such as the problem of inferring Markov random fields (MRFs) with a sparsity or robustness prior can be naturally modeled in…

To compute the hyperbolicity constant is an almost intractable problem, thus it is natural to try to bound it in terms of some parameters of the graph. Let $\mathcal{G}(g,c,n)$ be the set of graphs $G$ with girth $g(G)=g$, circumference…

We study scalar-linear and vector-linear solutions of the generalized combination network. We derive new upper and lower bounds on the maximum number of nodes in the middle layer, depending on the network parameters and the alphabet size.…

The first multiplicative Zagreb index of a graph $G$ is the product of the square of every vertex degree, while the second multiplicative Zagreb index is the product of the degree of each edge over all edges. In our work, we explore the…

We provide some new estimates for distances in harmonic function spaces of several variables related to mixed norm spaces.Some of them extend previously known assertions in this direction in the unit ball and upperhalfspace.

Variational inequalities represent a broad class of problems, including minimization and min-max problems, commonly found in machine learning. Existing second-order and high-order methods for variational inequalities require precise…