This HTML5 document contains 37 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n17http://dbpedia.org/resource/File:
n6https://global.dbpedia.org/id/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n8http://puzzler.sourceforge.net/docs/
n4http://www2.stetson.edu/~efriedma/mathmagic/
n19http://commons.wikimedia.org/wiki/Special:FilePath/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n21http://did.mat.uni-bayreuth.de/wassermann/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbchttp://dbpedia.org/resource/Category:
dbphttp://dbpedia.org/property/
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Polystick
rdfs:label
Polystick
rdfs:comment
In recreational mathematics, a polystick (or polyedge) is a polyform with a line segment (a 'stick') as the basic shape. A polystick is a connected set of segments in a regular grid. A square polystick is a connected subset of a regular square grid. A triangular polystick is a connected subset of a regular triangular grid. Polysticks are classified according to how many line segments they contain. The name "polystick" seems to have been first coined by Brian R. Barwell.
foaf:depiction
n19:Polysticks.svg
dcterms:subject
dbc:Polyforms
dbo:wikiPageID
710384
dbo:wikiPageRevisionID
1090101871
dbo:wikiPageWikiLink
dbr:Polyform dbr:Vertex_(graph_theory) dbr:Sponge_spicule dbc:Polyforms dbr:Unstructured_grid dbr:List_of_uniform_tilings dbr:Recreational_mathematics n17:Polysticks.svg dbr:Regular_grid dbr:Line_segment dbr:Connected_graph dbr:Polyomino dbr:Sea_sponges
dbo:wikiPageExternalLink
n4:0806.html n8:polysticks.html n21:tetrastick.pdf n4:
owl:sameAs
n6:4tWcP freebase:m.034t0m wikidata:Q7226991
dbp:wikiPageUsesTemplate
dbt:Polyforms dbt:Short_description dbt:Reflist dbt:Clear dbt:OEIS2C
dbo:thumbnail
n19:Polysticks.svg?width=300
dbo:abstract
In recreational mathematics, a polystick (or polyedge) is a polyform with a line segment (a 'stick') as the basic shape. A polystick is a connected set of segments in a regular grid. A square polystick is a connected subset of a regular square grid. A triangular polystick is a connected subset of a regular triangular grid. Polysticks are classified according to how many line segments they contain. The name "polystick" seems to have been first coined by Brian R. Barwell. The names "polytrig" and "polytwigs" has been proposed by David Goodger to simplify the phrases "triangular-grid polysticks" and "hexagonal-grid polysticks," respectively. Colin F. Brown has used an earlier term "polycules" for the hexagonal-grid polysticks due to their appearance resembling the spicules of sea sponges. There is no standard term for line segments built on other regular tilings, an unstructured grid, or a simple connected graph, but both "polynema" and "polyedge" have been proposed. When reflections are considered distinct we have the one-sided polysticks. When rotations and reflections are not considered to be distinct shapes, we have the free polysticks. Thus, for example, there are 7 one-sided square tristicks because two of the five shapes have left and right versions. The set of n-sticks that contain no closed loops is equivalent, with some duplications, to the set of (n+1)-ominos, as each vertex at the end of every line segment can be replaced with a single square of a polyomino. In general, an n-stick with m loops is equivalent to a (n−m+1)-omino (as each loop means that one line segment does not add a vertex to the figure).
gold:hypernym
dbr:Polyform
prov:wasDerivedFrom
wikipedia-en:Polystick?oldid=1090101871&ns=0
dbo:wikiPageLength
5117
foaf:isPrimaryTopicOf
wikipedia-en:Polystick