TITLE

Autologlyphs

AUTHOR(S)
Segerman, Henry; Dehaye, Paul-Olivier
PUB. DATE
March 2004
SOURCE
Mathematical Intelligencer;Spring2004, Vol. 26 Issue 2, p37
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Presents autologlyphs or mathematical patterns that form words. Appeal of the patterns.
ACCESSION #
13233930

 

Related Articles

  • Simplified space vector PWM algorithm for five-level inverter. D. Lalili; E. Berkouk; F. Boudjema; N. Lourci; T. Taleb; J. Petzold // European Physical Journal - Applied Physics;Dec2007, Vol. 40 Issue 3, p335 

    In this work, we present an algorithm for the space vector pulse width modulation (SVPWM) applied to five-level diode clamped inverter. In this algorithm, the space vector diagram of the five-level inverter is decomposed into six space vector diagrams of three-level inverters. In turn, each of...

  • Research of Image Stitching Method Based on Graph Cuts and Poisson Fusion. Yan Gong; Hong Xie; Wu Xie; Yun Lin // International Journal of Multimedia & Ubiquitous Engineering;2014, Vol. 9 Issue 10, p101 

    This paper considers the problem of ghosting artifacts and stitching seam caused by image stitching and fusion directly, which influenced by the registration and geometric transformation, and the differences between the two images overlap region. This paper proposed maximum flow / minimum cut in...

  • Privacy Survey Goes Public! Entin, Carli // Scholastic Math;05/07/2001, Vol. 21 Issue 14, p6 

    Demonstrates how to make a circle graph using data from a survey about privacy rights.

  • Non-Separating Paths in 4-Connected Graphs. Kawarabayashi, Ken-ichi; Lee, Orlando; Xingxing Yu // Annals of Combinatorics;2005, Vol. 9 Issue 1, p47 

    In 1975, Lov�sz conjectured that for any positive integerk, there exists a minimum positive integerf(k) such that, for any two verticesx,yin anyf(k)-connected graphG, there is a pathPfromxtoyinGsuch thatG-V(P) isk-connected. A result of Tutte impliesf(1) = 3. Recently,f(2) = 5 was shown by...

  • Independent packings in structured graphs. Cameron, Kathie; Hell, Pavol // Mathematical Programming;Feb2006, Vol. 105 Issue 2/3, p201 

    Packing a maximum number of disjoint triangles into a given graph G is NP-hard, even for most classes of structured graphs. In contrast, we show that packing a maximum number of independent (that is, disjoint and nonadjacent) triangles is polynomial-time solvable for many classes of structured...

  • Skewness of Graphs with Small Cutsets. Farr, Graham; Eades, Peter // Graphs & Combinatorics;Jun2003, Vol. 19 Issue 2, p177 

    The skewness of a graph is the minimum number of edges that have to be removed to leave a planar subgraph. This is complementary, and computationally equivalent, to the Maximum Planar Subgraph problem. In this paper we look at the problem of computing the skewness of a graph with a small cutset....

  • Packing 4-Cycles in Eulerian and Bipartite Eulerian Tournaments with an Application to Distances in Interchange Graphs. Yuster, Raphael // Annals of Combinatorics;2005, Vol. 9 Issue 1, p117 

    We prove that every Eulerian orientation ofK m,n containsarc-disjoint directed 4-cycles, improving earlier lower bounds. Combined with a probabilistic argument, this result is used to prove that every regular tournament with n vertices containsarc-disjoint directed 4-cycles. The result is also...

  • Menger�s theorem for infinite graphs. Aharoni, Ron; Berger, Eli // Inventiones Mathematicae;Apr2009, Vol. 176 Issue 1, p1 

    We prove that Menger�s theorem is valid for infinite graphs, in the following strong version: let A and B be two sets of vertices in a possibly infinite digraph. Then there exist a set $\mathcal{P}$ of disjoint A� B paths, and a set S of vertices separating A from B, such that S...

  • Strong chromatic index of products of graphs. Togni, Olivier // Discrete Mathematics & Theoretical Computer Science (DMTCS);Jun2007, Vol. 9 Issue 1, p47 

    The strong chromatic index of a graph is the minimum number of colours needed to colour the edges in such a way that each colour class is an induced matching. In this paper, we present bounds for the strong chromatic index of three different products of graphs in terms of the strong chromatic...

Share

Read the Article

Courtesy of VIRGINIA BEACH PUBLIC LIBRARY AND SYSTEM

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics