Rounds, Color, Parity, Squares

11/29/2021
by   Steven Finch, et al.
0

This is a sequel to our paper "Permute, Graph, Map, Derange", involving decomposable combinatorial labeled structures in the exp-log class of type a=1/2, 1, 3/2, 2. As before, our approach is to establish how well existing theory matches experimental data and to raise open questions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/10/2021

Permute, Graph, Map, Derange

We study decomposable combinatorial labeled structures in the exp-log cl...
research
02/15/2022

Second Best, Third Worst, Fourth in Line

We investigate decomposable combinatorial labeled structures more fully,...
research
01/14/2022

Aspects of Muchnik's paradox in restricted betting

Muchnik's paradox says that enumerable betting strategies are not always...
research
04/03/2022

Combinatorial refinement on circulant graphs

The combinatorial refinement techniques have proven to be an efficient a...
research
05/28/2022

Overcoming Congestion in Distributed Coloring

We present a new technique to efficiently sample and communicate a large...
research
04/13/2020

Pentagon contact representations

Representations of planar triangulations as contact graphs of a set of i...
research
08/18/2021

Algorithmic techniques for finding resistance distances on structured graphs

In this paper we give a survey of methods used to calculate values of re...

Please sign up or login with your details

Forgot password? Click here to reset