Related papers: Effective computations for weakly optimal subvarie…

This paper provides characterizations of the weak solutions of optimization problems where a given vector function $F,$ from a decision space $X$ to an objective space $Y$, is "minimized" on the set of elements $x\in C$ (where $C\subset X$…

We show using statistically rigorous arguments that the technique of weak value amplification (WVA) does not perform better than standard statistical techniques for the tasks of single parameter estimation and signal detection. Specifically…

The elaboration of new quantization methods has recently developed the interest in the study of subalgebras of the Lie algebra of polynomial vector fields over a Euclidean space. In this framework, these subalgebras define maximal…

Finite-sum optimization plays an important role in the area of machine learning, and hence has triggered a surge of interest in recent years. To address this optimization problem, various randomized incremental gradient methods have been…

We pursue various restricted variable generalizations of the Chevalley-Warning theorem for low degree polynomial systems over a finite field. Our first such result involves variables restricted to Cartesian products of the Vandermonde…

In this paper, we introduce a new notion of convergence for the Laplace eigenfunctions in the semiclassical limit, the local weak convergence. This allows us to give a rigorous statement of Berry's random wave conjecture. Using recent…

By a reduction method, the limiting weak-type behaviors of factional maximal operators and fractional integrals are established without any smoothness assumption on the kernel, which essentially improve and extend previous results. As a…

This study delves into equilibrium problems, focusing on the identification of finite solutions for feasible solution sequences. We introduce an innovative extension of the weak sharp minimum concept from convex programming to equilibrium…

In this work, we provide some novel results that establish both the existence of Henig global proper efficient points and their density in the efficient set for vector optimization problems in arbitrary normed spaces. Our results do not…

Let $R$ be an associative algebra over a field $K$ generated by a vector subspace $V$. The polynomial $f(x_1,\ldots,x_n)$ of the free associative algebra $K\langle x_1,x_2,\ldots\rangle$ is a weak polynomial identity for the pair $(R,V)$ if…

Graphons are analytic objects representing limits of convergent sequences of graphs. Lov\'asz and Szegedy conjectured that every finitely forcible graphon, i.e. any graphon determined by finitely many graph densities, has a simple…

Let $N$ be a submodule of a finitely generated module $M$ over a Noetherian ring. A method for the computation of the submodule generated by the envelope of $N$ is given. The relations between weakly prime submodules and their envelopes are…

In this paper we deal with infinite horizon optimal control problems. Basing on weak variations in an extremal problem in weighted function spaces we prove necessary conditions in form of the adjoint equation and a variational inequality.…

We reformulate the problem of modularity maximization over the set of partitions of a network as a conic optimization problem over the completely positive cone, converting it from a combinatorial optimization problem to a convex continuous…

We consider the Neumann problem for the equation with the Vladimirov-Taibleson fractional differentiation operator over a non-Archimedean local field. We study weak solutions following the method by Dipierro, Ros-Oton and Valdinoci (2017).…

We consider a definition of a weakly convex set which is a generalization of the notion of a weakly convex set in the sense of Vial and a proximally smooth set in the sense of Clarke, from the case of the Hilbert space to a class of Banach…

A weakly constrained code is a collection of finite-length strings over a finite alphabet in which certain substrings or patterns occur according to some prescribed frequencies. Buzaglo and Siegel (ITW 2017) gave a construction of weakly…

A weak multiplier Hopf algebra is a pair (A,\Delta) of a non-degenerate idempotent algebra A and a coproduct $\Delta$ on A. The coproduct is a coassociative homomorphism from A to the multiplier algebra M(A\otimes A) with some natural extra…

The real solutions to a system of sparse polynomial equations may be realized as a fiber of a projection map from a toric variety. When the toric variety is orientable, the degree of this map is a lower bound for the number of real…

Upper bounds are given for the weight distribution of binary weakly self-dual codes. To get these new bounds, we introduce a novel method of utilizing unitary operations on Hilbert spaces. This method is motivated by recent progress on…