references of discrete association schemeLinear programming for combinatorics/graph theoryAssociation between Hamiltonian and Eulerian graphsReferences for Hyperbolic Graph TheoryHow can a finite graph be viewed as a discrete analogue of a Riemann surface?Example of non-commutative association scheme$left(n+1right)times left(n+1right)$ algebra isomorphic to Bose-Mesner algebra?references of modular representations for finite groupReferences For Alliances (Graph Theory)Cyclotomic scheme is a Association schemeReference on properties of the queen graph $Q_n$?
Are astronomers waiting to see something in an image from a gravitational lens that they've already seen in an adjacent image?
Accidentally leaked the solution to an assignment, what to do now? (I'm the prof)
Why can't I see bouncing of a switch on an oscilloscope?
How is the claim "I am in New York only if I am in America" the same as "If I am in New York, then I am in America?
Theorems that impeded progress
Modeling an IP Address
How can I make my BBEG immortal short of making them a Lich or Vampire?
What defenses are there against being summoned by the Gate spell?
Find the result of this dual key cipher
tikz convert color string to hex value
What are these boxed doors outside store fronts in New York?
Languages that we cannot (dis)prove to be Context-Free
Can you really stack all of this on an Opportunity Attack?
LWC SFDX source push error TypeError: LWC1009: decl.moveTo is not a function
Paid for article while in US on F-1 visa?
What's the output of a record needle playing an out-of-speed record
Which country benefited the most from UN Security Council vetoes?
Can a Cauchy sequence converge for one metric while not converging for another?
Perform and show arithmetic with LuaLaTeX
How can I prevent hyper evolved versions of regular creatures from wiping out their cousins?
Is it possible to record a short contained sound no longer than 60 milliseconds?
Arrow those variables!
Watching something be written to a file live with tail
Why does Kotter return in Welcome Back Kotter?
references of discrete association scheme
Linear programming for combinatorics/graph theoryAssociation between Hamiltonian and Eulerian graphsReferences for Hyperbolic Graph TheoryHow can a finite graph be viewed as a discrete analogue of a Riemann surface?Example of non-commutative association scheme$left(n+1right)times left(n+1right)$ algebra isomorphic to Bose-Mesner algebra?references of modular representations for finite groupReferences For Alliances (Graph Theory)Cyclotomic scheme is a Association schemeReference on properties of the queen graph $Q_n$?
$begingroup$
I tried to find a book or paper to understanding discrete association scheme but I could not get any book for that. What is the good references for that?
abstract-algebra combinatorics graph-theory association-schemes
$endgroup$
|
show 4 more comments
$begingroup$
I tried to find a book or paper to understanding discrete association scheme but I could not get any book for that. What is the good references for that?
abstract-algebra combinatorics graph-theory association-schemes
$endgroup$
$begingroup$
What do you mean by "discrete association scheme"? Are you just looking for an association schemes reference?
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:02
$begingroup$
It would be easier to give an answer if you can say what is motivating your interest in association schemes.
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:03
$begingroup$
There are some special association scheme like Hamming scheme, Johnson scheme, etc. Discrete association scheme is just a special example of scheme.
$endgroup$
– user275240
Feb 9 '16 at 10:21
$begingroup$
So by "discrete" do you just mean that the underlying set is finite? (I have studied association schemes a bit, but never heard this term)
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 10:43
$begingroup$
Yes, the underling set must be finite e.g. $X=1,2,3,4,5,6,7$ , $G=1,2,3,4,5,6,7$ then $(X,G)$ is a discrete assocoation scheme.
$endgroup$
– user275240
Feb 9 '16 at 11:58
|
show 4 more comments
$begingroup$
I tried to find a book or paper to understanding discrete association scheme but I could not get any book for that. What is the good references for that?
abstract-algebra combinatorics graph-theory association-schemes
$endgroup$
I tried to find a book or paper to understanding discrete association scheme but I could not get any book for that. What is the good references for that?
abstract-algebra combinatorics graph-theory association-schemes
abstract-algebra combinatorics graph-theory association-schemes
edited Mar 29 at 11:37
azimut
16.5k1052101
16.5k1052101
asked Feb 9 '16 at 7:15
user275240user275240
599
599
$begingroup$
What do you mean by "discrete association scheme"? Are you just looking for an association schemes reference?
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:02
$begingroup$
It would be easier to give an answer if you can say what is motivating your interest in association schemes.
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:03
$begingroup$
There are some special association scheme like Hamming scheme, Johnson scheme, etc. Discrete association scheme is just a special example of scheme.
$endgroup$
– user275240
Feb 9 '16 at 10:21
$begingroup$
So by "discrete" do you just mean that the underlying set is finite? (I have studied association schemes a bit, but never heard this term)
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 10:43
$begingroup$
Yes, the underling set must be finite e.g. $X=1,2,3,4,5,6,7$ , $G=1,2,3,4,5,6,7$ then $(X,G)$ is a discrete assocoation scheme.
$endgroup$
– user275240
Feb 9 '16 at 11:58
|
show 4 more comments
$begingroup$
What do you mean by "discrete association scheme"? Are you just looking for an association schemes reference?
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:02
$begingroup$
It would be easier to give an answer if you can say what is motivating your interest in association schemes.
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:03
$begingroup$
There are some special association scheme like Hamming scheme, Johnson scheme, etc. Discrete association scheme is just a special example of scheme.
$endgroup$
– user275240
Feb 9 '16 at 10:21
$begingroup$
So by "discrete" do you just mean that the underlying set is finite? (I have studied association schemes a bit, but never heard this term)
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 10:43
$begingroup$
Yes, the underling set must be finite e.g. $X=1,2,3,4,5,6,7$ , $G=1,2,3,4,5,6,7$ then $(X,G)$ is a discrete assocoation scheme.
$endgroup$
– user275240
Feb 9 '16 at 11:58
$begingroup$
What do you mean by "discrete association scheme"? Are you just looking for an association schemes reference?
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:02
$begingroup$
What do you mean by "discrete association scheme"? Are you just looking for an association schemes reference?
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:02
$begingroup$
It would be easier to give an answer if you can say what is motivating your interest in association schemes.
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:03
$begingroup$
It would be easier to give an answer if you can say what is motivating your interest in association schemes.
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:03
$begingroup$
There are some special association scheme like Hamming scheme, Johnson scheme, etc. Discrete association scheme is just a special example of scheme.
$endgroup$
– user275240
Feb 9 '16 at 10:21
$begingroup$
There are some special association scheme like Hamming scheme, Johnson scheme, etc. Discrete association scheme is just a special example of scheme.
$endgroup$
– user275240
Feb 9 '16 at 10:21
$begingroup$
So by "discrete" do you just mean that the underlying set is finite? (I have studied association schemes a bit, but never heard this term)
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 10:43
$begingroup$
So by "discrete" do you just mean that the underlying set is finite? (I have studied association schemes a bit, but never heard this term)
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 10:43
$begingroup$
Yes, the underling set must be finite e.g. $X=1,2,3,4,5,6,7$ , $G=1,2,3,4,5,6,7$ then $(X,G)$ is a discrete assocoation scheme.
$endgroup$
– user275240
Feb 9 '16 at 11:58
$begingroup$
Yes, the underling set must be finite e.g. $X=1,2,3,4,5,6,7$ , $G=1,2,3,4,5,6,7$ then $(X,G)$ is a discrete assocoation scheme.
$endgroup$
– user275240
Feb 9 '16 at 11:58
|
show 4 more comments
0
active
oldest
votes
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: "69"
;
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
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
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%2fmath.stackexchange.com%2fquestions%2f1647209%2freferences-of-discrete-association-scheme%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
0
active
oldest
votes
0
active
oldest
votes
active
oldest
votes
active
oldest
votes
Thanks for contributing an answer to Mathematics Stack Exchange!
- 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');
);
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%2fmath.stackexchange.com%2fquestions%2f1647209%2freferences-of-discrete-association-scheme%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');
);
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');
);
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');
);
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
$begingroup$
What do you mean by "discrete association scheme"? Are you just looking for an association schemes reference?
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:02
$begingroup$
It would be easier to give an answer if you can say what is motivating your interest in association schemes.
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 9:03
$begingroup$
There are some special association scheme like Hamming scheme, Johnson scheme, etc. Discrete association scheme is just a special example of scheme.
$endgroup$
– user275240
Feb 9 '16 at 10:21
$begingroup$
So by "discrete" do you just mean that the underlying set is finite? (I have studied association schemes a bit, but never heard this term)
$endgroup$
– Morgan Rodgers
Feb 9 '16 at 10:43
$begingroup$
Yes, the underling set must be finite e.g. $X=1,2,3,4,5,6,7$ , $G=1,2,3,4,5,6,7$ then $(X,G)$ is a discrete assocoation scheme.
$endgroup$
– user275240
Feb 9 '16 at 11:58