Skip to main content

All Questions

Filter by
Sorted by
Tagged with
2 votes
3 answers
3k views

dual space of a subspace of the space of bounded measures

Let $\mathcal{M}=\mathcal{M}(\mathbb{R})$ be the space of bounded measures. Equipped with the weak convergence, the dual space of $\mathcal{M}$ is $\mathcal{C}_b(\mathbb{R})$ consisting of continuous ...
CodeGolf's user avatar
  • 1,835
2 votes
1 answer
2k views

Finding a point farthest away from $k$ points in a polygon

There are $k$ points placed inside a polygon and I am interested in finding a point inside the polygon (not necessarily on its boundary) who's minimum distance to any of the $k$ points is maximized. ...
marc's user avatar
  • 57
2 votes
1 answer
137 views

Design constraint systems over the reals

This question is inspired by the discussion at this problem. Suppose I have a design consisting of a finite point set $U$ of size $|U|=m_{\emptyset}$ and a family of $n$ subsets (sometimes called ...
Aaron Meyerowitz's user avatar
2 votes
1 answer
770 views

Why is the Tate local duality pairing compatible with the Cartier duality pairing?

This question is a follow up to Why is the norm map dual to restriction under Tate local duality? Let $A$ and $B$ be dual abelian schemes over a base scheme $S$. For an integer $n \ge 1$, consider ...
Question Mark's user avatar
2 votes
1 answer
155 views

Tempered distributions at non-coinciding points and density of Schwartz functions

In the previous question, I find that situation is much less favorable than expected…. So I add more details to focus on the specific case I have in mind. Let us consider the Schwartz space $\mathcal{...
Isaac's user avatar
  • 3,477
2 votes
2 answers
403 views

Is this a linear optimization problem? $Ax=0$, $A$ has $m$ rows and $n$ columns, $m \le n$, all entries of $x$ are non-negative

$Ax=0$, $A$ has $m$ rows and $n$ columns, $m \le n$, all entries of $x$ are non-negative. What should $A$ satisfy to guarantee the equation set have only zero solution?
ZhongHua Yan's user avatar
1 vote
2 answers
121 views

How to solve the optimization problem $\max_{\mathbf{w}}\sum_i\text{sign}(\mathbf{w}^T \mathbf{x}_i)$?

I am looking for an algorithm to solve the following optimization problem $$\max_{\mathbf{w}}\sum_i\text{sign}(\mathbf{w}^T \mathbf{x}_i)$$ where $\mathbf{w}$ and each $\mathbf{x}_i\in\mathbb{R}^d$. ...
user3750444's user avatar

1
2