« first day (2793 days earlier)      last day (1107 days later) » 

7:47 AM
@MartinSleziak The tag still has only one question and no tag-info.
3
Q: Infinite-dimensional quasifields

Jeremy DoverIn their seminal paper on translation planes (The Construction of Translation Planes from Projective Spaces, Journal of Algebra 1:85-102, 1964, https://doi.org/10.1016/0021-8693(64)90010-9), Bruck and Bose proved that every translation plane coordinatized by a quasifield that is finite-dimensiona...

@YCor As far as I can tell, you're the creator of this tag. So I thought that it might be useful to remind that it might get auto-deleted eventually.
@1.. I see that you have created (quantum-games) tag. It might be useful to create also tag-wiki or at least tag-excerpt. It might help other users to use the tag correctly. (This is probably not a problem here, since the tag name seems to be descriptive enough.) Another reason is that the tags used on only one question are automatically deleted after six months unless they have tag-wiki. — Martin Sleziak 9 secs ago
Quantum game theory is an extension of classical game theory to the quantum domain. It differs from classical game theory in three primary ways: Superposed initial states, Quantum entanglement of initial states, Superposition of strategies to be used on the initial states.This theory is based on the physics of information much like quantum computing. == Superposed initial states == The information transfer that occurs during a game can be viewed as a physical process. In the simplest case of a classical game between two players with two strategies each, both the players can use a bit (a '0' or...
 
8:03 AM
@MartinSleziak The tag now has six questions.
0
Q: The diameter of random regular graphs

Ranveer SinghIn 1982, B. Bollobas and Vega in the paper gave the configurational model to generate $r$-regular random graphs. They gave the following theorem (Theorem 1 in the paper). Theorem: Let $r\geq 3$ and $\epsilon> 0$ be fixed and define $d=d(n)$ as the least integer satisfying $$(r-1)^{d-1}\geq (2+\e...

1
Q: Lower bound for $\vert \det A \vert $ for the adjacency matrix of regular graphs

Mohammad Ali NematollahiAssume $G$ is a simple $k$-regular graph of order $n$ with adjacency matrix $A$ which is non-singular. Does anyone know some lower bounds for $\vert \det (A) \vert$ with respect to $n$, $k$ or both? Thanks in advance.

0
Q: Decomposition of regular graphs

vidyarthiLet $G$ be a regular simple graph with degree $\Delta=n-k-1$ and order $m$. Let $C_k$ be the regular graph which is formed by removing a $k$-factor from the complete graph $K_{n}$. I think we could always find a proper induced subgraph of $C_k$ with maximum degree at least $\ge\frac{\Delta}{2}$ ...

3
Q: Chromatic number of regular graphs using spectra

vidyarthiThere exist inequalities relating the maximum and minimum eigenvalues of the adjacency matrix of a graph with its chromatic numbers, i.e. the Wilf's and Hoffmann's inequalities, which put together state that $1-\frac{\lambda_{max}}{\lambda_{min}}\le\chi(G)\le 1+\lambda_{max}$, where $\chi, \lambd...

2
Q: Efficiently generating all regular/bidegreed graphs

Sergey IvanovThere is a related question on how to generate all regular graphs; however, the procedure is random and repeats the generated graphs. Plus, there is no stop condition, unless recording the total number of non-isomorphic graphs and matching it to the known numbers. I wonder if there is a more effi...

5
Q: Smallest $3$-regular graph with a unique perfect matching

PickupSticksWhat is the smallest 3-regular graph to have a unique perfect matching? With a large enough number of nodes, it is possible for a 3-regular graph to have no perfect matching (example can be seen in this question Cubic graphs without a perfect matching and a vertex incident to three bridges ). So ...

 
 
2 hours later…
10:28 AM
There are now two questions tagged :
3
Q: Infinite-dimensional quasifields

Jeremy DoverIn their seminal paper on translation planes (The Construction of Translation Planes from Projective Spaces, Journal of Algebra 1:85-102, 1964, https://doi.org/10.1016/0021-8693(64)90010-9), Bruck and Bose proved that every translation plane coordinatized by a quasifield that is finite-dimensiona...

4
Q: On duality on finite projective planes

Juan OSHey Everyone! In nearly all (if not all) projective geometry texts I have bumped into the following theorem: "Principle of duality: If in a theorem in $\mathfrak{P}$ one switches the word point for the word line and the corresponding incidence relations once again one obtains a theorem of $\math...

 
 
1 hour later…
11:38 AM
It seems that there are several posts with dead links to Eric Moorhouse website: search for url:"uwyo.edu/moorhouse"
The link in the post seems to be dead, here is at least a Wayback Machine link. This seems to be the new location: ericmoorhouse.org/pub/planes27Martin Sleziak 26 mins ago
I have added at least the Wayback Machine for the link in this post. It seems that the page was moved here: ericmoorhouse.org/pub/planesMartin Sleziak 4 mins ago
I see only one comment with a link to that website: data.stackexchange.com/mathoverflow/query/556789/…
Not sure about the bound in general but there are some results about existence of sub-planes that are known. For example, combinatorics.org/ojs/index.php/eljc/article/view/v18i1p2. For details on small planes you can also refer to uwyo.edu/moorhouse/pub/planesAnurag Jan 12 '15 at 12:48
 

« first day (2793 days earlier)      last day (1107 days later) »