/
constructors.jl
240 lines (203 loc) · 7.81 KB
/
constructors.jl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
###############################################################################
###############################################################################
### Definition and constructors
###############################################################################
###############################################################################
#TODO: have cone accept exterior description and reserve positive hull for
#interior description?
struct Cone{T} <: PolyhedralObject{T} #a real polymake polyhedron
pm_cone::Polymake.BigObject
parent_field::Field
# only allowing scalar_types;
# can be improved by testing if the template type of the `BigObject` corresponds to `T`
Cone{T}(c::Polymake.BigObject, f::Field) where {T<:scalar_types} = new{T}(c, f)
Cone{QQFieldElem}(c::Polymake.BigObject) = new{QQFieldElem}(c, QQ)
end
# default scalar type: `QQFieldElem`
cone(x...; kwargs...) = Cone{QQFieldElem}(x...; kwargs...)
# Automatic detection of corresponding OSCAR scalar type;
# Avoid, if possible, to increase type stability
function cone(p::Polymake.BigObject)
T, f = _detect_scalar_and_field(Cone, p)
return Cone{T}(p, f)
end
@doc raw"""
positive_hull([::Union{Type{T}, Field} = QQFieldElem,] R::AbstractCollection[RayVector] [, L::AbstractCollection[RayVector]]; non_redundant::Bool = false) where T<:scalar_types
A polyhedral cone, not necessarily pointed, defined by the positive hull of the
rays `R`, with lineality given by `L`. The first argument either specifies the
`Type` of its coefficients or their parent `Field`.
`R` is given row-wise as representative vectors, with lineality generated by the
rows of `L`, i.e. the cone consists of all positive linear combinations of the
rows of `R` plus all linear combinations of the rows of `L`.
This is an interior description, analogous to the $V$-representation of a
polytope.
Redundant rays are allowed.
# Examples
To construct the positive orthant as a `Cone`, you can write:
```jldoctest
julia> R = [1 0; 0 1];
julia> PO = positive_hull(R)
Polyhedral cone in ambient dimension 2
```
To obtain the upper half-space of the plane:
```jldoctest
julia> R = [0 1];
julia> L = [1 0];
julia> HS = positive_hull(R, L)
Polyhedral cone in ambient dimension 2
```
"""
function positive_hull(
f::scalar_type_or_field,
R::AbstractCollection[RayVector],
L::Union{AbstractCollection[RayVector],Nothing}=nothing;
non_redundant::Bool=false,
)
parent_field, scalar_type = _determine_parent_and_scalar(f, R, L)
inputrays = remove_zero_rows(unhomogenized_matrix(R))
if isnothing(L) || isempty(L)
L = Polymake.Matrix{_scalar_type_to_polymake(scalar_type)}(undef, 0, _ambient_dim(R))
end
if non_redundant
return Cone{scalar_type}(
Polymake.polytope.Cone{_scalar_type_to_polymake(scalar_type)}(;
RAYS=inputrays, LINEALITY_SPACE=unhomogenized_matrix(L)
),
parent_field,
)
else
return Cone{scalar_type}(
Polymake.polytope.Cone{_scalar_type_to_polymake(scalar_type)}(;
INPUT_RAYS=inputrays, INPUT_LINEALITY=unhomogenized_matrix(L)
),
parent_field,
)
end
end
# Redirect everything to the above constructor, use QQFieldElem as default for the
# scalar type T.
positive_hull(
R::AbstractCollection[RayVector],
L::Union{AbstractCollection[RayVector],Nothing}=nothing;
non_redundant::Bool=false,
) = positive_hull(_guess_fieldelem_type(R, L), R, L; non_redundant=non_redundant)
cone(
R::AbstractCollection[RayVector],
L::Union{AbstractCollection[RayVector],Nothing}=nothing;
non_redundant::Bool=false,
) = positive_hull(_guess_fieldelem_type(R, L), R, L; non_redundant=non_redundant)
cone(
f::scalar_type_or_field,
R::AbstractCollection[RayVector],
L::Union{AbstractCollection[RayVector],Nothing}=nothing;
non_redundant::Bool=false,
) = positive_hull(f, R, L; non_redundant=non_redundant)
cone(f::scalar_type_or_field, x...) = positive_hull(f, x...)
function ==(C0::Cone{T}, C1::Cone{T}) where {T<:scalar_types}
return Polymake.polytope.equal_polyhedra(pm_object(C0), pm_object(C1))::Bool
end
# For a proper hash function for cones we should use a "normal form",
# which would require a potentially expensive convex hull computation
# (and even that is not enough). But hash methods should be fast, so we
# just consider the ambient dimension and the precise type of the cone.
function Base.hash(x::T, h::UInt) where {T<:Cone}
h = hash(ambient_dim(x), h)
h = hash(T, h)
return h
end
@doc raw"""
cone_from_inequalities([::Union{Type{T}, Field} = QQFieldElem,] I::AbstractCollection[LinearHalfspace] [, E::AbstractCollection[LinearHyperplane]]; non_redundant::Bool = false)
The (convex) cone defined by
$$\{ x | Ix ≤ 0, Ex = 0 \}.$$
Use `non_redundant = true` if the given description contains no redundant rows to
avoid unnecessary redundancy checks.
The first argument either specifies the `Type` of its coefficients or their
parent `Field`.
# Examples
```jldoctest
julia> C = cone_from_inequalities([0 -1; -1 1])
Polyhedral cone in ambient dimension 2
julia> rays(C)
2-element SubObjectIterator{RayVector{QQFieldElem}}:
[1, 0]
[1, 1]
```
"""
function cone_from_inequalities(
f::scalar_type_or_field,
I::AbstractCollection[LinearHalfspace],
E::Union{Nothing,AbstractCollection[LinearHyperplane]}=nothing;
non_redundant::Bool=false,
)
parent_field, scalar_type = _determine_parent_and_scalar(f, I, E)
IM = -linear_matrix_for_polymake(I)
EM = if isnothing(E) || isempty(E)
Polymake.Matrix{_scalar_type_to_polymake(scalar_type)}(undef, 0, size(IM, 2))
else
linear_matrix_for_polymake(E)
end
if non_redundant
return Cone{scalar_type}(
Polymake.polytope.Cone{_scalar_type_to_polymake(scalar_type)}(;
FACETS=IM, LINEAR_SPAN=EM
),
parent_field,
)
else
return Cone{scalar_type}(
Polymake.polytope.Cone{_scalar_type_to_polymake(scalar_type)}(;
INEQUALITIES=IM, EQUATIONS=EM
),
parent_field,
)
end
end
@doc raw"""
cone_from_equations([::Union{Type{T}, Field} = QQFieldElem,] E::AbstractCollection[LinearHyperplane]; non_redundant::Bool = false)
The (convex) cone defined by
```math
\{ x | Ex = 0 \}.
```
Use `non_redundant = true` if the given description contains no redundant rows to
avoid unnecessary redundancy checks.
The first argument either specifies the `Type` of its coefficients or their
parent `Field`.
# Examples
```jldoctest
julia> C = cone_from_equations([1 0 0; 0 -1 1])
Polyhedral cone in ambient dimension 3
julia> lineality_space(C)
1-element SubObjectIterator{RayVector{QQFieldElem}}:
[0, 1, 1]
julia> dim(C)
1
```
"""
function cone_from_equations(
f::scalar_type_or_field,
E::AbstractCollection[LinearHyperplane];
non_redundant::Bool=false,
)
parent_field, scalar_type = _determine_parent_and_scalar(f, E)
EM = linear_matrix_for_polymake(E)
IM = Polymake.Matrix{_scalar_type_to_polymake(scalar_type)}(undef, 0, size(EM, 2))
return cone_from_inequalities(f, IM, EM; non_redundant=non_redundant)
end
cone_from_inequalities(x...) = cone_from_inequalities(QQFieldElem, x...)
cone_from_equations(E::AbstractCollection[LinearHyperplane]; non_redundant::Bool=false) =
cone_from_equations(_guess_fieldelem_type(E), E; non_redundant=non_redundant)
"""
pm_object(C::Cone)
Get the underlying polymake `Cone`.
"""
pm_object(C::Cone) = C.pm_cone
###############################################################################
###############################################################################
### Display
###############################################################################
###############################################################################
function Base.show(io::IO, C::Cone{T}) where {T<:scalar_types}
print(io, "Polyhedral cone in ambient dimension $(ambient_dim(C))")
T != QQFieldElem && print(io, " with $T type coefficients")
end
Polymake.visual(C::Cone; opts...) = Polymake.visual(pm_object(C); opts...)