相关论文: Solving the Gleason problem on linearly convex dom…

It has been a widely belief that for a planar convex domain with two coordinate axes of symmetry, the location of maximal norm of gradient of torsion function is either linked to contact points of largest inscribed circle or connected to…

We study a finite horizon optimal control problem for the continuity equation under a weighted integral state constraint on the mass outside a fixed set. The model is cast in a Hilbert framework for densities. On a suitable invariant…

Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. Under an ordering condition on the slopes of the functions at the origin, an algorithm that determines the optimum…

In this paper the problem of maximizing the distance to a given fixed point over an intersection of balls is considered. It is known that this problem is NP complete in the general case, since any subset sum problem can be solved upon…

We solve Talagrand's entropy problem: the L_2-covering numbers of every uniformly bounded class of functions are exponential in its shattering dimension. This extends Dudley's theorem on classes of {0,1}-valued functions, for which the…

This article investigates the numerical approximation of shape optimization problems with PDE constraint on classes of convex domains. The convexity constraint provides a compactness property which implies well posedness of the problem.…

We consider the following geometric optimization problem: find a convex polygon of maximum area contained in a given simple polygon $P$ with $n$ vertices. We give a randomized near-linear-time $(1-\varepsilon)$-approximation algorithm for…

We strengthen, in various directions, the theorem of Garnett that every $\sigma$-compact, completely regular space $X$ occurs as a Gleason part for some uniform algebra. In particular, we show that the uniform algebra can always be chosen…

Maximizing high-dimensional, non-convex functions through noisy observations is a notoriously hard problem, but one that arises in many applications. In this paper, we tackle this challenge by modeling the unknown function as a sample from…

We establish several results related to existence, nonexistence or bifurcation of positive solutions for a Dirichlet boundary value problem with in a smooth bounded domain. The main feature of this paper consists in the presence of a…

We look for the minimizers of the functional $\jla{\la}(\oo)=\la|\oo|-P(\oo)$ among planar convex domains constrained to lie into a given ring. We prove that, according to the values of the parameter $\la$, the solutions are either a disc…

Let K be a field, [n]= {1,...,n} and H=([n],E) be a hypergraph. For an integer d >= 1 the Lovasz-Saks-Schrijver ideal (LSS-ideal) L_H^K (d) in K[y_{ij}~:~(i,j) \in [n] x [d]] is the ideal generated by the polynomials $f^{(d)}_{e}=…

We prove that the maximal dimension of a subspace $V$ of the generic tensor product of $m$ symbol algebras of prime degree $p$ with $\operatorname{Tr}(v^{p-1})=0$ for all $v\in V$ is $\frac{p^{2m}-1}{p-1}$. The same upper bound is thus…

In nice cases, a zero-dimensional complete intersection ideal over a field of characteristic zero has a Shape Lemma. There are also cases where the ideal is generated by the resultant and first subresultant polynomials of the generators.…

This paper considers the linear objective function optimization with respect to a novel system of fuzzy relation equations, where the fuzzy compositions are defined by the minimum t-norm. It is proved that the feasible solution set is…

For an arithmetically Cohen--Macaulay subscheme of projective space, there is a well-known bound for the highest degree of a minimal generator for the defining ideal of the subscheme, in terms of the Hilbert function. We prove a natural…

The thesis concentrates on two problems in discrete geometry, whose solutions are obtained by analytic, probabilistic and combinatoric tools. The first chapter deals with the strong polarization problem. This states that for any sequence…

We prove global existence of strong solutions for the Vlasov-Poisson system in a convex bounded domain in the plasma physics case assuming homogeneous Dirichlet boundary conditions for the electric potential and the specular reflection…

In a real Hilbert space $\mathcal{H}$. Given any function $f$ convex differentiable whose solution set $\argmin_{\mathcal{H}}\,f$ is nonempty, by considering the Proximal Algorithm $x_{k+1}=\text{prox}_{\b_k f}(d x_k)$, where $0<d<1$ and…

For the solution of the Poisson problem with an $L^\infty$ right hand side \begin{equation*} \begin{cases} -\Delta u(x) = f (x) & \mbox{in } D, u=0 & \mbox{on } \partial D, \end{cases} \end{equation*} we derive an optimal estimate of the…