Constructing Group Divisible Designs - Algorithms?Are there analogues of Desargues and Pappus for block designs?A generalization of covering designs and lottery wheelsIs there an infinite number of combinatorial designs with $r=lambda^2$Pairwise balanced designs with $r=lambda^2$Resolvable designs from projective spaceConstructions of $2-(v,3,3)$-designsAll $2$-designs arising from the action of the affine linear group on the field of prime orderExistence of Steiner system designs given $n,k,t$A question on the behavior of intersections of certain block designCovering designs where $v$ is linear in $k$
Constructing Group Divisible Designs - Algorithms?
Are there analogues of Desargues and Pappus for block designs?A generalization of covering designs and lottery wheelsIs there an infinite number of combinatorial designs with $r=lambda^2$Pairwise balanced designs with $r=lambda^2$Resolvable designs from projective spaceConstructions of $2-(v,3,3)$-designsAll $2$-designs arising from the action of the affine linear group on the field of prime orderExistence of Steiner system designs given $n,k,t$A question on the behavior of intersections of certain block designCovering designs where $v$ is linear in $k$
$begingroup$
I am starting my research on group divisible designs this year and I wonder if there are any algorithms/software that help with constructions.
Thank you
co.combinatorics combinatorial-designs
asked 4 hours ago
JakeJake
61
New contributor
Jake is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I am starting my research on group divisible designs this year and I wonder if there are any algorithms/software that help with constructions.
Thank you
co.combinatorics combinatorial-designs
asked 4 hours ago
JakeJake
61
New contributor
Jake is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
add a comment |
$begingroup$
I am starting my research on group divisible designs this year and I wonder if there are any algorithms/software that help with constructions.
Thank you
co.combinatorics combinatorial-designs
asked 4 hours ago
JakeJake
61
New contributor
Jake is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
$endgroup$
I am starting my research on group divisible designs this year and I wonder if there are any algorithms/software that help with constructions.
Thank you
co.combinatorics combinatorial-designs
co.combinatorics combinatorial-designs
asked 4 hours ago
JakeJake
61
New contributor
Jake is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 4 hours ago
JakeJake
61
New contributor
Jake is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 4 hours ago
JakeJake
61
New contributor
Jake is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
asked 4 hours ago
JakeJake
61
asked 4 hours ago
JakeJake
61
61
New contributor
Jake is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
New contributor
Jake is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
Jake is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.
add a comment |
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
There are some implementations available in sagemath, see e.g. http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/designs/group_divisible_designs.html#sage-combinat-designs-group-divisible-designs
answered 3 hours ago
Dima PasechnikDima Pasechnik
9,20811851
$endgroup$
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "504"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Jake is a new contributor. Be nice, and check out our Code of Conduct.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326242%2fconstructing-group-divisible-designs-algorithms%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
There are some implementations available in sagemath, see e.g. http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/designs/group_divisible_designs.html#sage-combinat-designs-group-divisible-designs
answered 3 hours ago
Dima PasechnikDima Pasechnik
9,20811851
$endgroup$
add a comment |
$begingroup$
There are some implementations available in sagemath, see e.g. http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/designs/group_divisible_designs.html#sage-combinat-designs-group-divisible-designs
answered 3 hours ago
Dima PasechnikDima Pasechnik
9,20811851
$endgroup$
add a comment |
$begingroup$
There are some implementations available in sagemath, see e.g. http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/designs/group_divisible_designs.html#sage-combinat-designs-group-divisible-designs
answered 3 hours ago
Dima PasechnikDima Pasechnik
9,20811851
$endgroup$
There are some implementations available in sagemath, see e.g. http://doc.sagemath.org/html/en/reference/combinat/sage/combinat/designs/group_divisible_designs.html#sage-combinat-designs-group-divisible-designs
answered 3 hours ago
Dima PasechnikDima Pasechnik
9,20811851
answered 3 hours ago
Dima PasechnikDima Pasechnik
9,20811851
answered 3 hours ago
Dima PasechnikDima Pasechnik
9,20811851
answered 3 hours ago
Dima PasechnikDima Pasechnik
9,20811851
9,20811851
add a comment |
add a comment |
Jake is a new contributor. Be nice, and check out our Code of Conduct.
Jake is a new contributor. Be nice, and check out our Code of Conduct.
Jake is a new contributor. Be nice, and check out our Code of Conduct.
Jake is a new contributor. Be nice, and check out our Code of Conduct.
Thanks for contributing an answer to MathOverflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326242%2fconstructing-group-divisible-designs-algorithms%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
var $window = $(window),
onScroll = function(e)
var $elem = $('.new-login-left'),
docViewTop = $window.scrollTop(),
docViewBottom = docViewTop + $window.height(),
elemTop = $elem.offset().top,
elemBottom = elemTop + $elem.height();
if ((docViewTop elemBottom))
StackExchange.using('gps', function() StackExchange.gps.track('embedded_signup_form.view', location: 'question_page' ); );
$window.unbind('scroll', onScroll);
;
$window.on('scroll', onScroll);
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
