Results 191 to 200 of about 1,340 (226)
Some of the next articles are maybe not open access.
Ordering and Convex Polyominoes
2005We introduce a partial order on pictures (matrices), denoted by ≼ that extends to two dimensions the subword ordering on words. We investigate properties of special families of discrete sets (corresponding to {0,1}-matrices) with respect to this partial order.
CASTIGLIONE, Giuseppa, RESTIVO, Antonio
openaire +1 more source
A polyomino with no stochastic function
Combinatorica, 1984A polyomino P is defined to be a finite subset of the set S of unit squares with integer vertices in \(R^ 2\). A rectangle \(R^*\) of P is maximal if it is not properly contained in another rectangle of P. A function f from P to the non-negative reals is called a stochastic function if, for every maximal rectangle \(R^*\) of P, \(\sum_{s\in R^*}f(s)=1.\
Jeff Kahn 0001, Michael E. Saks
openaire +1 more source
Polyomino-Tiled AESA for LEO Satcom on-the-Move Connectivity
2024 IEEE International Symposium on Phased Array Systems and Technology (ARRAY)The trend towards cost-effective phased arrays (PAs) with simplified architectures is nowadays driven by the development of mobile communication systems and non-terrestrial/satellite networks.
P. Rocca +6 more
semanticscholar +1 more source
Covering a Polyomino-Shaped Stain with Non-Overlapping Identical Stickers
Fun with AlgorithmsYou find a stain on the wall and decide to cover it with non-overlapping stickers of a single identical shape (rotation and reflection are allowed). Is it possible to find a sticker shape that fails to cover the stain?
Keigo Oka, Naoki Inaba, Akira Iino
semanticscholar +1 more source
Planar Graph Orientation Frameworks, Applied to KPlumber and Polyomino Tiling
arXiv.orgGiven a graph, when can we orient the edges to satisfy local constraints at the vertices, where each vertex specifies which local orientations of its incident edges are allowed?
Zachary Abel +4 more
semanticscholar +1 more source
Combinatorial properties of polyominoes
Combinatorica, 1981A finite set of cells in the infinite planar square grid is often called a polyomino. With each polyominoP, we may associate a hypergraph whose vertices are the cells ofP and whose edges are the maximal rectangles (in the standard position) contained inP.
Claude Berge 0001 +3 more
openaire +2 more sources
Information Processing Letters, 2017
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Information Processing Letters, 1994
The perfect graph approach to study the combinatorial structure of visibility graphs in polyominos can be traced back to a paper of Berge et al., who made a survey of results and a collection of problems related to polyominos. In more recent works, Rajeev, Motwani et al.
openaire +2 more sources
The perfect graph approach to study the combinatorial structure of visibility graphs in polyominos can be traced back to a paper of Berge et al., who made a survey of results and a collection of problems related to polyominos. In more recent works, Rajeev, Motwani et al.
openaire +2 more sources
Forcing and anti-forcing polynomials of a type of polyomino graphs
Computational and Applied Mathematics, 2023Kai Deng, Huazhong Lü, Tingzeng Wu
semanticscholar +1 more source