All Questions
793 questions
2
votes
0
answers
55
views
Tangential normal invariant isomorphism
Recently, I was reading the paper "Finite Group Actions on Kervaire Manifold" by Crowley, Hambolton. But I am having problem understanding a definition. Here it is,
In page 15-16 they are ...
2
votes
0
answers
157
views
Why do von Neumann algebras possess identity?
My starting point is that a von Neumann algebra is a $C^*$-algebra with a predual. The usual approaches to showing the existence of identity involve spectral theory (for approximate identity), but ...
- 433
2
votes
0
answers
146
views
Explicit S-duality map
$\DeclareMathOperator{\Th}{Th}$
The Thom space of a closed manifold $M$ ($\Th(M)$) is the $S$-dual to $M_+ (=M \cup \{pt\})$. Let $M$ be embedded in $\mathbf R^{n+k}$. I found the duality map from $S^...
1
vote
0
answers
94
views
Linear Program Optimal Value
If $f(A,b,c)$ is the optimal value of a linear program
$\min c.x$
subject to $A.x \leq b ; x \geq 0.$
Does $f(A,b,c)$ have a piecewise polynomial/rational upper bound in $(A,b,c)$ on the domain of ...
0
votes
1
answer
114
views
Mixed integer program and continuous Diophantine approximation
Let $n\in\mathbb{N}$ such that $n\geq 2$ and let $0<r<1$ be a real number. We wish to solve the following problem.
$$\min_{(t,(z_j)_{j=2}^n) \in \mathbb{R}\times \mathbb{Z}^{n-1}} t$$
subject to ...
5
votes
0
answers
138
views
Rings over which free modules of a certain rank are reflexive (satisfy Specker's theorem)
Following this question about the case of $\mathbb{Z}_{(p)}$, I've got to ask what is known more generally about rings and dimensions for which Specker's theorem holds. Let me make the following ...
- 32.5k
7
votes
2
answers
269
views
Double dual of free $\mathbb{Z}_{(p)}$-modules
For an abelian group $A$, put $DA=\text{Hom}(A,\mathbb{Z})$ and $D_{(p)}A=\text{Hom}(A,\mathbb{Z}_{(p)})$. It is a theorem of Specker that when $A$ is free abelian of countable rank, the natural map $...
- 56.9k
2
votes
1
answer
240
views
Is the problem of vertex enumeration from an H-representation of a polytope NP-hard?
According to the Wikipedia page on the issue, the vertex enumeration problem is NP-hard.
However, double description and reverse linear search are algorithms listed to solve the problem. Moreover, ...
- 123
0
votes
0
answers
55
views
Relationship of optimal solutions between the total function and the sub function
This is an unconstrained convex optimization problem. Let $\mathcal{N}=\left\{1,\ldots,n\right\}$, $2\leq n<\infty$. Suppose there are many strongly convex functions $f_i(x)$, where $x\in\mathbb{R}^...
- 1
0
votes
0
answers
85
views
Show that $\max_{P_X : X\in (0,1) } \left| \frac{\mathbb{E} [ f'(X) ]}{ \mathbb{E} [ f(X) ] } \right|$ is maximized by at most two mass points
Let $f$ be some given well-behaved function. Consider the following optimization problem overall probability distribution on $[0,1]$
\begin{align}
\max_{P_X : X\in [0,1] } \left| \frac{\mathbb{E} [ ...
- 671
1
vote
1
answer
69
views
$A^*$ algorithm to find shortest path when weights in my graph are the inverse of distance
Given a graph G=(V,E) where the weights on my edges are inverse of Euclidian distance between nodes, I want to know if I can use A* algorithm to find the shortest path. How I need to modify the ...
- 111
10
votes
1
answer
599
views
Isbell Duality and Dualizing Scheme Objects
I'm not sure if this question is too elementary for MO; nevertheless, I have seen many helpful discussions surrounding this topic here. I'm interested in studying the adjunction $\operatorname{Spec}\...
- 223
1
vote
1
answer
119
views
Optimization on non-convex set
Let $\Omega$ be an open bounded subset of $\mathbb{R}^2$ and $f\in L^2(\Omega)$ be a given function. Consider the optimization problem
$$\mathrm{min} \int_\Omega u(x) f(x) \,dx\,,$$
where a minimum is ...
- 11
12
votes
2
answers
1k
views
Does Poincaré duality preserve algebraic cycles?
Let $X$ be a smooth, projective (complex) variety of dimension $n$ and $Z \subset X$ be a subvariety of codimension $k$ (if necessary assume $Z$ is non-singular). We know the cohomology class $[Z]$ of ...
- 2,323
1
vote
1
answer
55
views
From relative convexity to modulus of continuity estimates for the dual gradient mapping
Let $F: \mathbf{R}^d \to \mathbf{R}$ be a convex function, let $m > 0$, and define $Q_m: \mathbf{R}^d \to \mathbf{R}$ to be the mapping $x \mapsto \frac{m}{2} \| x \|_2^2$. One says that $F$ is $m$-...
- 801
0
votes
2
answers
530
views
Any idea of solving an optimization problem with cubic constraints?
I have the following optimization problem with cubic constraints, which is hard to solve. Are there any ideas, or related references, of solving such a problem?
$$ \begin{array}{ll} \underset {y, z} {\...
- 21
3
votes
0
answers
151
views
Weak*-separability of the unit ball of $X’$ and density characters and cardinalities of $X$ and $X’$
(This question has also been asked on Math StackExchange.)
Let $X$ be a Banach space, $X’$ be its continuous dual such that its unit ball is weak*-separable. I’ve been wondering what can be said about ...
- 2,830
5
votes
1
answer
177
views
Complemented subspaces of a dual Banach space
Let $\kappa$ be an infinite cardinal number and by $\mathcal{B}(\kappa)$ denote the class of all Banach spaces of density $\kappa$.
My question reads as follows:
Does there exist $\kappa$ for which ...
- 1,151
1
vote
1
answer
212
views
Homology of complements and homotopy equivalence
Albrecht Dold gave a short proof of the Jordan-Alexander complement theorem in the following form.
Given two closed sets $A$, $B \subset {\bf R}^n$ that are homeomorphic, the singular homology groups $...
- 18.7k
1
vote
0
answers
178
views
$BMO$ is not reflexive
It is well known that $BMO$ is the dual space of the Hardy space $H^1$, which is the dual space of $VMO$. I believe that $BMO$ is not reflexive, but I am not quite sure that the above information is ...
- 16.2k
1
vote
3
answers
619
views
Given a compact set $K \subset \mathbb{R}^n$, is the space of distributions supported on $K$ the dual of some test function space?
I am aware that the dual of $C^\infty(\mathbb{R}^n)$ is the space of distributions (not necessarily tempered) with compact support.
However, if we fix a compact set $K \subset \mathbb{R}^n$, is the ...
- 3,477
4
votes
0
answers
495
views
Fixing the duality $L^\infty(X)= L^1(X)^*$ for Radon measure spaces
Consider the following fragment from Folland's book "A course in abstract harmonic analysis":
Let me denote the Borel subsets of $X$ by $\mathscr{B}(X)$. Folland claims that if $\mu$ is a ...
- 175
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$.
...
- 175
1
vote
1
answer
89
views
Legendre transformation of vector valued function
Good afternoon. Is there any generalisation of Legendre--Fenchel transformation to the vector-valued functions $f: \mathbb{R}^n \to \mathbb{R}^n$?
3
votes
0
answers
105
views
Techniques for solving linear inequalities
For $n$ real variables $x_1, \ldots, x_n$, I have a bunch of inequalities of form $2 x_i > x_j + x_k$ or $2 x_i < x_j + x_k$, where $i,j,k$ are distinct. My goal is to determine whether this set ...
- 231
0
votes
1
answer
103
views
Constrained linear optimization problem on $C^1$
I am dealing with a problem of the form ($a<b$)
$$
\displaystyle \max_{v \in C^1([a, b])} \int_a^b v(x)~\mathrm{d}x, \quad \mathrm{s.t.} \int^b_a \big(-o'(x)v(x)-v'(x)o(x)\big)f(x)~\mathrm{d}x \...
1
vote
0
answers
36
views
Does Hoffman constant keep the same after a very tiny perturbation on the polyhedron such that the bases are even unchanegd?
Suppose that $P$ is a polyhedron represented by
$$P:=\{x \in \mathbb{R}^n: A x \le b \} \text{ for }A \in \mathbb{R}^{m\times n},\ b \in \mathbb{R}^m,$$
and $P$ contains interior points. Moreover, the ...
- 33
6
votes
0
answers
163
views
Explicit computations of Serre duality for elliptic curves
I have an elliptic curve $E$ defined over a ring $R$, I want to compute the pairing
$$
H^1(E,\mathcal{O}_E)\times H^0(E, \Omega_E^1){\rightarrow}R.
$$
Clearly we have that $H^0(E, \Omega_E^1)=R \...
- 109
0
votes
0
answers
145
views
Bound on solutions of $Ax \ge b$
Let $A \in \mathbb{Z}^{m \times n}, b \in \mathbb{Z}^{m \times 1}$.
One can show that if there is a solution of $Ax \ge b, x \in \mathbb{R}^n$ then there is one such that $\|x\|_{\infty} \le c (\|A\|_{...
- 439
0
votes
0
answers
84
views
1-degree SOS proof refutes Linear Programming
I am trying to understand Sums-of-Squares proof systems.
A degree $d$ Sums-of-Squares refutation for a set of polynomial equations $P = \{p_1(x) = 0, ..., p_m(x) = 0\}$ is defined as
$\sum_{i=1}^m g_i(...
1
vote
1
answer
119
views
Adding linear constraint to the domain
I don't know if it is a well-known problem, but I have been struggling to come up with an algorithm.
I have a set of linear constraints $Ax\le b$, $b\ge 0$ ($b$ and $A$ are given, $x$ is a variable). ...
4
votes
0
answers
112
views
Duality for finite quotient groups of finitely generated free abelian groups
$\newcommand{\Z}{{\Bbb Z}}
\newcommand{\Q}{{\Bbb Q}}
\newcommand{\Hom}{{\rm Hom}}
$ The following lemma is certainly known.
Lemma (well-known).
Let $B$ be a lattice (that is, a finitely generated ...
- 14.1k
1
vote
0
answers
96
views
On optimizing a multivariate quadratic function subject to certain conditions
The problem is to maximize $f(x_1,x_2,\cdots,x_n)=\sum\limits_{i=1}^{n}\Big(x_i-k_i\Big)^2$ for $n\ge 3$ subject to the conditions (1) $\sum\limits_{i=1}^{n}x_i=\sum\limits_{i=1}^{n}k_i\le n(n-1)$ ...
- 61
2
votes
0
answers
94
views
Is it possible to deduce Poincaré duality from duality of polytopes?
I'm having trouble understanding Poincaré duality, as it seems unmotivated. Here for instance:
https://math.stackexchange.com/a/14469/454016
Poincaré duality is explained through a duality of ...
1
vote
0
answers
335
views
Closed-form solution of a particular linear program
(Note: I asked a similar question at math.stackexchange but the present one is more precise.)
I have a linear program of the form:
$$\text{minimize} \space\space x_1 \space\space \text{subject to:}$$
$...
- 988
1
vote
1
answer
169
views
Best projection on non-convex discrete set with two constraints
I want to compute the projection of a vector $\left( x\right) _{1\leq
i,j\leq n}\in \lbrack 0,1]^{n\times n}$ on the following discrete set
$$
S=\left\{ x\in \{0,1\}^{n\times n}:x_{i,j}+x_{j,i}\leq 1;\...
- 47
2
votes
1
answer
61
views
Counting the number of pair of d-uplets with upper bounded distance
Consider two d-uplets $u = (u_1,...,u_d)$ and $v = (v_1, ..., v_d)$ both living in $\mathbb{N}^d$ with $d$ a positive integer. They both verify $$(*) \sum_{i=1}^d u_i = \sum_{i=1}^d v_i = k$$ with $k$ ...
- 55
10
votes
0
answers
533
views
Isbell duality between algebras and sheaves
nLab says on Isbell duality, the following:
A general abstract adjunction
$(\mathcal{O} \dashv \operatorname{Spec}) : \mathrm{CoPresheaves} \leftrightarrows \mathrm{Presheaves}$
relates (higher) ...
- 1,347
0
votes
1
answer
147
views
Is there a redundant constraint in linear programming? [closed]
From wikipedia:
But... Why do we need the $x\ge 0$ part? We can instead do $-x\le 0$, and thus saving a line in the definition (which is not a big deal but nevertheless nice).
(In order to do that, ...
- 3
0
votes
0
answers
272
views
Finding the eigenvectors of a submatrix
Let $A=(a_{kl})$ be a matrix in $M_n(\mathbb{R})$ when $n$ is even. Let $B=(b_{kl})$ be the symmetric $2n$ by $2n$ matrix whose entries are given by,
$b_{k,l}=a_{kl}$ if $1\leq k,l\leq n$.
$b_{n+k,l}=...
- 4,058
1
vote
0
answers
47
views
Nash Equilibria change linearly in (some) game parameters. Already known / follows from a more general result?
EDIT: The key thing that I am wondering about is the linearity of the P2 strategy, not the constancy of P1. (The latter is straightforward.)
Question: Is the following result already known? Or is it a ...
0
votes
1
answer
82
views
Combining Dantzig-Wolfe and Benders decomposition
I'm now solving an LP that has a few coupling rows (as in Dantzig-Wolfe decomposition) and a few coupling columns (as in Benders decomposition) simultaneously; other rows and columns are block-angular....
- 3
3
votes
1
answer
283
views
Riesz representation theorem for duals of spaces of continuously differentiable functions
Let $k$ be a positive integer. I am looking for a possibly exhaustive reference discussing representation of dual spaces of $C^k_b(\mathbb{R}^d)$, $C^k_0(\mathbb{R}^d)$, or at least $C^k(K)$ for ...
- 171
1
vote
0
answers
64
views
Is the Lie bracket on $\mathfrak g^{\ast}$ induced from a cocommutator defined on $\mathfrak g\ $?
Let $G$ be a Poisson-Lie group. Let $\mathfrak g = \text {Lie} (G) = T_1 G$ be the corresponding Lie algebra. Then the Poisson structure on $G$ gives rise to a Lie bracket $[\cdot, \cdot]$ on $\...
- 199
0
votes
1
answer
36
views
Benefit of adding a trivial constraint to ILPs
let ILP be an integer linear program with constraints-matrix $\boldsymbol{\mathrm{M}}\in\mathbb{Z}^{m\times n}$ and cost vector $\boldsymbol{\mathrm{c}}\in\mathbb{Z}^n$,
${\boldsymbol{\mathrm{x}}^*}\...
- 13.2k
0
votes
0
answers
94
views
Boolean operation on n dimensional polyhedron
A polyhedron in $R^n$ is defined by a set of half-planes: $P = \{x \in R^n \mid Ax - b \le 0\}$.
Given a set of polyhedra in $R^n$, $ P_1, P_2, \dotsc, P_k$, is there an algorithm/implementation that ...
- 21
0
votes
1
answer
93
views
How quickly can this IQP or its MILP relaxation be solved
Let $A\in\{0,1\}^{(n,n)}$ be a $n$ by $n$ boolean matrix (in particular think of an adjacency matrix of a graph), and consider the following optimization problem:
$$\begin{align*}&&\max_{P\in\{...
- 71
5
votes
0
answers
160
views
Faltings' Cartier duality for A-modules in terms of Hopf algebras
$\newcommand\dual{^{\text{dual}}}\newcommand\GrpSch{\mathrm{GrpSch}}\DeclareMathOperator\Hom{Hom}\DeclareMathOperator\Vect{Vect}$If $G$ is a finite group scheme over a field $k$, we can define its ...
10
votes
1
answer
401
views
Finite domination and Poincaré duality spaces
Here are some definitions:
A space is homotopy finite if it is homotopy equivalent to a finite CW complex.
A space finitely dominated if it is a retract of a homotopy finite space.
A space $X$ is a ...
- 18.8k
0
votes
1
answer
538
views
Method for (binary) optimization under constraints
I would like to know if there is a method to solve the Problem.
Problem:
Maximize the following function: $$f(p_{1,i},p_{2,i},\dotsc,p_{m,i})=\sum_{i=1}^{n}\begin{bmatrix}p_{1,i} & p_{2,i} & \...
- 3