Related papers: Equivalences of biprojective almost perfect nonlin…
Symmetric submodular functions are an important family of submodular functions capturing many interesting cases including cut functions of graphs and hypergraphs. Maximization of such functions subject to various constraints receives little…
A family of sharp $L^p$ Sobolev inequalities is established by averaging the length of $i$-dimensional projections of the gradient of a function. Moreover, it is shown that each of these new inequalities directly implies the classical $L^p$…
Standard probability theory has been extremely successful but there are some conceptually possible scenarios, such as fair infinite lotteries, that it does not model well. For this reason alternative probability theories have been…
An entire solution of the Allen-Cahn equation $\Delta u=f(u)$, where $f$ has exactly three zeros at $\pm 1$ and 0, is balanced and odd, e.g. $f(u)=u(u^2-1)$, is called a $2k$-ended solution if its nodal set is asymptotic to $2k$ half lines,…
We introduce a generalization of the notion of approximately proper equivalence relations studied by Renault and with it we build an \'etale groupoid. Choosing a suitable set of continuous functions to play the role of a potential, we…
The split common fixed point problems has found its applications in various branches of mathematics both pure and applied. It provides us a unified structure to study a large number of nonlinear mappings. Our interest here is to apply these…
Inspired by a recent work of Mesnager, we present several new infinite families of quadratic ternary bent, near-bent and 2-plateaued functions from some known quadratic ternary bent functions. Meanwhile, the distribution of the Walsh…
We present a rigorous convergence analysis for cylindrical approximations of nonlinear functionals, functional derivatives, and functional differential equations (FDEs). The purpose of this analysis is twofold: first, we prove that…
In this paper, we prove that sufficiently regular solutions of any quasilinear PDE can be approximated by solutions of systems of N distinguishable particles, to within 1/ ln(N ). This intruiguing result is related to recent developments in…
In this paper, we present new efficiently solvable cases of the Minimum Uncovering Branching problem, an optimization problem with applications in cancer genomics introduced by Hujdurovi\'c, Husi\'c, Milani\v{c}, Rizzi, and Tomescu in 2018.…
In this paper, we introduce a family of real Monge-Amp\`ere functionals and study their variational properties. We prove a Sobolev type inequality for these functionals and use this to study the existence and uniqueness of some associated…
We combine two non-perturbative approaches, one based on the two-particle-irreducible (2PI) action, the other on the functional renormalization group (fRG), in an effort to develop new non-perturbative approximations for the field…
We establish a weighted simultaneous Khintchine-type theorem, both convergence and divergence, for all nondegenerate manifolds, which answers a problem posed in [Math. Ann., 337(4):769-796, 2007]. This extends the main results of [Acta…
Yuan's theorem of the alternative is an important theoretical tool in optimization, which provides a checkable certificate for the infeasibility of a strict inequality system involving two homogeneous quadratic functions. In this paper, we…
We present a parallel approximation algorithm for a class of mixed packing and covering semidefinite programs which generalize on the class of positive semidefinite programs as considered by Jain and Yao [2011]. As a corollary we get a…
In this paper, we study the parallelism between perfect numbers and Leinster groups and continue it by introducing the new concepts of almost and quasi Leinster groups which parallel almost and quasi perfect numbers. These are small…
In the Euclidean TSP with neighborhoods (TSPN), we are given a collection of n regions (neighborhoods) and we seek a shortest tour that visits each region. As a generalization of the classical Euclidean TSP, TSPN is also NP-hard. In this…
We consider a class of difference-of-convex (DC) optimization problems where the objective function is the sum of a smooth function and a possible nonsmooth DC function. The application of proximal DC algorithms to address this problem…
Dual feasible functions (DFFs) have been used to provide bounds for standard packing problems and valid inequalities for integer optimization problems. In this paper, the connection between general DFFs and a particular family of…
In this paper we propose a method for proving some exponential inequalities based on power series expansion and analysis of derivations of the corresponding functions. Our approach provides a simple proof and generates a new class of…