|
Eodermdrome
An eodermdrome is a form of word play wherein a word (or phrase) is formed from a set of letters (or words) in such a way that it has a non-planar spelling net. Gary S. Bloom, Allan Gewirtz, John W. Kennedy, and Peter J. Wexler first described the eodermdrome in May 1980, and it subsequently became more widely known after publication in '' Word Ways: The Journal of Recreational Linguistics'' in August 1980. It is well illustrated by the word ''eodermdrome'' itself. ''Eodermdrome'' contains only the letters e, o, d, r and m. When plotted as a graph, the lettered vertices are sequentially connected by edges to spell a word. If the graph is non-planar, the word is an eodermdrome. The graph of eodermdrome is the non-planar graph K5. Eckler searched for all eodermdromes in ''Webster's Dictionary''. One of his examples is ''supersaturates''. The graph of the complete word contains a subgraph which is a subdivision of the non- planar graph K3,3, and as such is itself non-planar. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Eodermdrome
An eodermdrome is a form of word play wherein a word (or phrase) is formed from a set of letters (or words) in such a way that it has a non-planar spelling net. Gary S. Bloom, Allan Gewirtz, John W. Kennedy, and Peter J. Wexler first described the eodermdrome in May 1980, and it subsequently became more widely known after publication in '' Word Ways: The Journal of Recreational Linguistics'' in August 1980. It is well illustrated by the word ''eodermdrome'' itself. ''Eodermdrome'' contains only the letters e, o, d, r and m. When plotted as a graph, the lettered vertices are sequentially connected by edges to spell a word. If the graph is non-planar, the word is an eodermdrome. The graph of eodermdrome is the non-planar graph K5. Eckler searched for all eodermdromes in ''Webster's Dictionary''. One of his examples is ''supersaturates''. The graph of the complete word contains a subgraph which is a subdivision of the non- planar graph K3,3, and as such is itself non-planar. ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Palindrome
A palindrome is a word, number, phrase, or other sequence of symbols that reads the same backwards as forwards, such as the words ''madam'' or ''racecar'', the date and time ''11/11/11 11:11,'' and the sentence: "A man, a plan, a canal – Panama". The 19-letter Finnish word ''saippuakivikauppias'' (a soapstone vendor), is the longest single-word palindrome in everyday use, while the 12-letter term ''tattarrattat'' (from James Joyce in ''Ulysses'') is the longest in English. The word ''palindrome'' was introduced by English poet and writer Henry Peacham in 1638.Henry Peacham, ''The Truth of our Times Revealed out of One Mans Experience'', 1638p. 123/ref> The concept of a palindrome can be dated to the 3rd-century BCE, although no examples survive; the first physical examples can be dated to the 1st-century CE with the Latin acrostic word square, the Sator Square (contains both word and sentence palindromes), and the 4th-century Greek Byzantine sentence palindrome ''nipson ano ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Word Play
Word play or wordplay (also: play-on-words) is a literary technique and a form of wit in which words used become the main subject of the work, primarily for the purpose of intended effect or amusement. Examples of word play include puns, phonetic mix-ups such as spoonerisms, obscure words and meanings, clever rhetorical excursions, oddly formed sentences, double entendres, and telling character names (such as in the play ''The Importance of Being Earnest'', ''Ernest'' being a given name that sounds exactly like the adjective ''earnest''). Word play is quite common in oral cultures as a method of reinforcing meaning. Examples of text-based (orthography, orthographic) word play are found in languages with or without alphabet-based scripts, such as homophonic puns in Mandarin Chinese. Techniques Some techniques often used in word play include interpreting idioms literally and creating contradictions and redundancies, as in Tom Swifties: :"Hurry up and get to the back of the shi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Planar Graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cross each other. Such a drawing is called a plane graph or planar embedding of the graph. A plane graph can be defined as a planar graph with a mapping from every node to a point on a plane, and from every edge to a plane curve on that plane, such that the extreme points of each curve are the points mapped from its end nodes, and all curves are disjoint except on their extreme points. Every graph that can be drawn on a plane can be drawn on the sphere as well, and vice versa, by means of stereographic projection. Plane graphs can be encoded by combinatorial maps or rotation systems. An equivalence class of topologically equivalent drawings on the sphere, usually with additional assumptions such as the absence of isthmuses, is called a pl ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Allan Gewirtz
The Gewirtz graph is a strongly regular graph with 56 vertices and valency 10. It is named after the mathematician Allan Gewirtz, who described the graph in his dissertation. ''Graphs with Maximal Even Girth'', Ph.D. Dissertation in Mathematics, City University of New York, 1967. Construction The Gewirtz graph can be constructed as follows. Consider the unique ''S''(3, 6, 22) , with 22 elements and 77 blocks. Choose a random element, and let the vertices be the 56 blocks not containing it. Two blocks are adjacent when they are disjoint. With this construction, one can embed the Gewirtz graph in the |
Peter J
Peter may refer to: People * List of people named Peter, a list of people and fictional characters with the given name * Peter (given name) ** Saint Peter (died 60s), apostle of Jesus, leader of the early Christian Church * Peter (surname), a surname (including a list of people with the name) Culture * Peter (actor) (born 1952), stage name Shinnosuke Ikehata, Japanese dancer and actor * ''Peter'' (album), a 1993 EP by Canadian band Eric's Trip * ''Peter'' (1934 film), a 1934 film directed by Henry Koster * ''Peter'' (2021 film), Marathi language film * "Peter" (''Fringe'' episode), an episode of the television series ''Fringe'' * ''Peter'' (novel), a 1908 book by Francis Hopkinson Smith * "Peter" (short story), an 1892 short story by Willa Cather Animals * Peter, the Lord's cat, cat at Lord's Cricket Ground in London * Peter (chief mouser), Chief Mouser between 1929 and 1946 * Peter II (cat), Chief Mouser between 1946 and 1947 * Peter III (cat), Chief Mouser between 1947 ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
The Journal Of Recreational Linguistics
''The'' () is a grammatical article in English, denoting persons or things already mentioned, under discussion, implied or otherwise presumed familiar to listeners, readers, or speakers. It is the definite article in English. ''The'' is the most frequently used word in the English language; studies and analyses of texts have found it to account for seven percent of all printed English-language words. It is derived from gendered articles in Old English which combined in Middle English and now has a single form used with pronouns of any gender. The word can be used with both singular and plural nouns, and with a noun that starts with any letter. This is different from many other languages, which have different forms of the definite article for different genders or numbers. Pronunciation In most dialects, "the" is pronounced as (with the voiced dental fricative followed by a schwa) when followed by a consonant sound, and as (homophone of pronoun ''thee'') when followed by a v ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Word Ways
''Word Ways: The Journal of Recreational Linguistics'' is a quarterly magazine on recreational linguistics, logology and word play. It was established by Dmitri Borgmann in 1968 at the behest of Martin Gardner. Howard Bergerson took over as editor-in-chief for 1969, but stepped down when Greenwood Periodicals dropped the publication. A. Ross Eckler Jr., a statistician at Bell Labs, became editor until 2006, when he was succeeded by Jeremiah Farrell (Butler University). ''Word Ways'' was the first periodical devoted exclusively to word play, and has become the foremost publication in that field. Lying "on the midpoint of a spectrum from popular magazine to scholarly journal", it publishes articles on various linguistic oddities and creative use of language. This includes research into and demonstrations of anagrams, pangrams, lipograms, tautonyms, univocalics, word ladders, palindromes and unusually long words, as well as book reviews, literature surveys, investigations into quest ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linguistics (journal)
''Linguistics: An Interdisciplinary Journal of the Language Sciences'' is a peer-reviewed academic journal of general linguistics published by De Gruyter Mouton. The journal publishes both articles and book reviews. It publishes two special issues a year. The current Editor-in-Chief is Johan van der Auwera. Since 2010, it publishes 1400 pages per year. History ''Linguistics'' was started in 1963 by Mouton Publishers in The Hague, apparently on the initiative of Mouton's Peter de Ridder as well as linguist C.H. van Schooneveld.Johan van der Auwera: Linguistics, the first 50 years, 2013 In 1979, after Mouton had been bought by Walter de Gruyter, a new editorial board was established, consisting of |
Graph Theory
In mathematics, graph theory is the study of ''graphs'', which are mathematical structures used to model pairwise relations between objects. A graph in this context is made up of '' vertices'' (also called ''nodes'' or ''points'') which are connected by '' edges'' (also called ''links'' or ''lines''). A distinction is made between undirected graphs, where edges link two vertices symmetrically, and directed graphs, where edges link two vertices asymmetrically. Graphs are one of the principal objects of study in discrete mathematics. Definitions Definitions in graph theory vary. The following are some of the more basic ways of defining graphs and related mathematical structures. Graph In one restricted but very common sense of the term, a graph is an ordered pair G=(V,E) comprising: * V, a set of vertices (also called nodes or points); * E \subseteq \, a set of edges (also called links or lines), which are unordered pairs of vertices (that is, an edge is associated with t ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Kuratowski's Theorem
In graph theory, Kuratowski's theorem is a mathematical forbidden graph characterization of planar graphs, named after Kazimierz Kuratowski. It states that a finite graph is planar if and only if it does not contain a subgraph that is a subdivision of K_5 (the complete graph on five vertices) or of K_ (a complete bipartite graph on six vertices, three of which connect to each of the other three, also known as the utility graph). Statement A planar graph is a graph whose vertices can be represented by points in the Euclidean plane, and whose edges can be represented by simple curves in the same plane connecting the points representing their endpoints, such that no two curves intersect except at a common endpoint. Planar graphs are often drawn with straight line segments representing their edges, but by Fáry's theorem this makes no difference to their graph-theoretic characterization. A subdivision of a graph is a graph formed by subdividing its edges into paths of one or mor ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
.png "Click for more on -> The Journal Of Recreational Linguistics")
