scientific article; zbMATH DE number 687006

From MaRDI portal
Revision as of 21:18, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4313096

zbMath0831.05020MaRDI QIDQ4313096

Solomon W. Golomb

Publication date: 10 November 1994


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Geometric properties of matrices induced by pattern avoidanceGENERALIZED DOMINOES TILING'S MARKOV CHAIN MIXES FASTSmall polyomino packingIrregular polyomino tiling via integer programming with application in phased array antenna designFamilies of irreptilesCombinatorial aspects of \(L\)-convex polyominoesEquality Testing of Compressed StringsJigsaw puzzles, edge matching, and polyomino packing: Connections and complexityA method to generate polyominoes and polyiamonds for tilings with rotational symmetryUnnamed ItemA generalization of the pentomino exclusion problem: dislocation of graphsTiling rectangles and half strips with congruent polyominoesConformal mappings of stretched polyominoes onto half-planeHelly numbers of polyominoesComplexity of tiling a polygon with trominoes or barsUnnamed ItemPacking polyominoes clumsilyHilbert series of parallelogram polyominoesExhaustive generation of gominoesCombinatorial properties of double square tilesUnnamed ItemOn the Enumeration of PermutominoesCommon Developments of Three Incongruent Boxes of Area 30Many L-shaped polyominoes have odd rectangular packingsLoops and regions in Hitomezashi patternsUnnamed ItemUnnamed ItemSelf-affine convex polygonsOn the construction of new toric quantum codes and quantum burst-error-correcting codesRegularity of binomial edge ideals of certain block graphsHilbert-Poincaré series and Gorenstein property for some non-simple polyominoesPrimality of multiply connected polyominoesIntersection graphs of maximal sub-polygons of \(k\)-lizardsAn extremal graph problem on a grid and an isoperimetric problem for polyominoesTiling with Monotone PolyominosOn degree-based topological indices of random polyomino chainsOn tiling the integers with 4-sets of the same gap sequenceShellable simplicial complex and switching rook polynomial of frame polyominoesThe site-perimeter of bargraphsCovering rectangles by few monotonous polyominoesComputational complexity of jumping block puzzlesPacking cube nets into rectangles with \(O(1)\) holesGeometrical regular languages and linear Diophantine equations: the strongly connected caseTiling One-Deficient Rectangular Solids with Trominoes in Three and Higher DimensionsOn the tiling system recognizability of various classes of convex polyominoesOn the complexity of Jensen's algorithm for counting fixed polyominoesUnnamed ItemHilbert series of simple thin polyominoesParliament seating assignment problemsCode for polyomino and computer search of isospectral polyominoesThe number of Z-convex polyominoesSome families of $alpha$-labeled subgraphs of the integral gridMirror-curves and knot mosaicsOn the table and the chairHinged dissection of polyominoes and polyformsA bijection for the total area of parallelogram polyominoesMinimal non-convex wordsPolyomino convolutions and tiling problemsAn algorithm for deciding if a polyomino tiles the planeResistance distances in the linear polyomino chainComparison of algorithms for reconstructing \(hv\)-convex discrete setsGeometrical Regular Languages and Linear Diophantine EquationsComputational complexity of jumping block puzzlesOn the tiling by translation problemRegular Geometrical Languages and Tiling the PlaneMathematical characterizations and computational complexity of anti-slide puzzlesMathematical characterizations and computational complexity of anti-slide puzzlesEnumeration of symmetry classes of convex polyominoes in the square latticeTetris and decidabilityScheduling with uncertain processing times in mixed-criticality systemsSolomon Golomb -- some personal reflections plus random biographical and bibliographical notesThe Perimeter of Proper PolycubesGray codes for column-convex polyominoes and a new class of distributive latticesOn Gröbner basis and Cohen-Macaulay property of closed path polyominoesUnnamed ItemPolycubes with small perimeter defectThe discrete Green theorem and some applications in discrete geometryPrimality of weakly connected collections of cells and weakly closed path polyominoesTiling a Manhattan Polyomino with BarsPerfect Matchings of the Small PolyominoesA short scientific biography of Maurice NivatPrimality of closed path polyominoes