> HMmmm... I am not sure I get the definition of this hypergraph
> completely, but I am not sure either that I know how to build it. Its
> edges do not seem very straightforward to list :-/
My mistake. It is doable, and quite doable. And it will be done soon,
possibly today.
Nathann
--
You rece
Y again,
> it is known that this dimension is equivalent to the chromatic number of
> certain hypergraph (hypergraph of incompatible pairs):
> http://www.ams.org/mathscinet-getitem?mr=1796000
HMmmm... I am not sure I get the definition of this hypergraph
completely, but I am not sure eith
On 23 Dec 2014 00:55, "Robert Jacobson" wrote:
>
> On Sunday, 21 December 2014 23:56:24 UTC-5, Dr. David Kirkby (Kirkby
Microwave Ltd) wrote:
>>
>> There is an open source command line interface to Mathematica.
>> Dave
>
>
> When I searched for one last week I was surprised not to find anything.
On 12/19/2014 10:14 AM, Jean-Pierre Flori wrote:
>
>
> On Friday, December 19, 2014 4:03:44 PM UTC+1, Bruno Grenet wrote:
>>
>> I've changed recently the status of a ticket to "needs review" since I
>> think it is not relevant anymore, and I wanted it to be closed. I now
>> guess it is not the
On Sunday, 21 December 2014 23:56:24 UTC-5, Dr. David Kirkby (Kirkby
Microwave Ltd) wrote:
>
> There is an open source command line interface to Mathematica. IIRC it
> uses curses so one can recall previous input, edit it and reevaluate.
>
> Dave
>
When I searched for one last week I was sur
I don't see anything wrong, its somewhere in the stuff that you haven't
posted. Inspect the generated cpp file or post a branch.
On Sunday, December 21, 2014 4:24:38 PM UTC+1, Jernej Azarija wrote:
>
> Volker,
>
> I am using gcc version 4.8.2 and the git version of sage that I myself
> compil
2014-12-22 19:09 UTC+01:00, Thierry :
> Beyond MILP generic way of solving things, a possibility could be to have
> a CSP solver (which is more expressive than MILP) such as
> http://numberjack.ucc.ie/ (whose interface is written in Python, throught
> somme better tools may exist) within Sage, so t
>
> <<
>
> We closed 4 tickets in this release. For details, see
>
> http://boxen.math.washington.edu/home/release/sage-6.4.1/tickets.html
>
> >>
>
>
Thanks, this is a known issue (to me and Jeroen and Harald and Volker,
anyway) and perhaps the easiest thing for now is for Harald to delete this
Hi,
On Mon, Dec 22, 2014 at 12:00:09PM +0200, Jori Mantysalo wrote:
> Should we made *something* for questions like this? As an another
> example, there is no known easy way to compute Frattini sublattice,
> i.e. intersection of all proper sublattices of a given lattice.
>
> Should we just make a
In the following changelog:
http://www.sagemath.org/mirror/src/changelogs/sage-6.4.1.txt
it is stated
<<
We closed 4 tickets in this release. For details, see
http://boxen.math.washington.edu/home/release/sage-6.4.1/tickets.html
>>
The link
http://boxen.math.washington.edu/home/release/
Hi,
it seems there is an algorithm based on graph colouring (about what Sage
knows a bit already), you can have a look at
http://www.sciencedirect.com/science/article/pii/S0196677498909749 (i
succeeded to download the pdf so email me if you need it)
Ciao,
Thierry
On Mon, Dec 22, 2014 at 01:19:
> it is known that this dimension is equivalent to the chromatic number of
> certain hypergraph (hypergraph of incompatible pairs):
> http://www.ams.org/mathscinet-getitem?mr=1796000
Ohhh cool ! I'll do that, thanks :-)
> Does Sage do colouring of hypergraphs (this is probably some dumb ILP
>
On 2014-12-22, Nathann Cohen wrote:
> HelloOO !
>
>> I didn't hear about that problem before, but I could try to give it some
>> thinking. Do you have any reference to start with?
>
> The wikipedia page contains some, including a pointer toward the
> result of NP-Hardness:
> http://en.wikiped
> Should we made *something* for questions like this?
I don't see what exactly we could do except thinking of an algorithm O_o
> Should we just make a function with note "This is direct computation with no
> optimization at all."? Being able to compute some examples it might be
> easier to try ot
On Mon, 22 Dec 2014, Nathann Cohen wrote:
I wondered how one could compute the dimension of a poset, i.e. a smallest set
of
linear extension whose interection is the poset.
It is apparently known for being NP-Hard, but that never stopped us in the past.
Plus I am curious to learn how this coul
HelloOO !
> I didn't hear about that problem before, but I could try to give it some
> thinking. Do you have any reference to start with?
The wikipedia page contains some, including a pointer toward the
result of NP-Hardness:
http://en.wikipedia.org/wiki/Order_dimension
It appears from time
I didn't hear about that problem before, but I could try to give it some
thinking. Do you have any reference to start with?
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an
I didn't hear about that problem before, but I could try to give it some
thinking. Do you have any reference to start with?
--
You received this message because you are subscribed to the Google Groups
"sage-devel" group.
To unsubscribe from this group and stop receiving emails from it, send an
On 2014-12-20, Ralf Stephan wrote:
> --=_Part_27_1333163343.1419064663220
> Content-Type: multipart/alternative;
> boundary="=_Part_28_1779416650.1419064663221"
>
> --=_Part_28_1779416650.1419064663221
> Content-Type: text/plain; charset=UTF-8
>
> On Sunday, October 26, 2014 8:4
Helloo everybody !
I wondered how one could compute the dimension of a poset, i.e. a smallest
set of linear extension whose interection is the poset.
It is apparently known for being NP-Hard, but that never stopped us in the
past. Plus I am curious to learn how this could be done. We need s
20 matches
Mail list logo
