Results 31 to 40 of about 920 (172)
Polyominoes determined by involutions [PDF]
Discrete Mathematics & Theoretical Computer Science, 2008 A permutomino of size n is a polyomino determined by particular pairs $(\pi_1, \pi_2)$ of permutations of length $n$, such that $\pi_1(i) \neq \pi_2(i)$, for $1 \leq i \leq n$.
Filippo Disanto, Simone Rinaldi
doaj +1 more source
A Bijection for Directed-Convex Polyominoes [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 In this paper we consider two classes of lattice paths on the plane which use \textitnorth, \textiteast, \textitsouth,and \textitwest unitary steps, beginningand ending at (0,0).We enumerate them according to the number ofsteps by means of bijective ...
Alberto Del Lungo +3 more
doaj +1 more source
Моделирование и анализ информационных систем, 2015 We study a problem about the number of lattice plane tilings by the given area centrosymmetrical polyominoes. A polyomino is a connected plane geomatric figure formed by joiining a finite number of unit squares edge to edge.
A. V. Shutov, E. V. Kolomeykina
doaj +1 more source
On counting Z-convex polyominoes [PDF]
, 2022 We show a decomposition that allows to compute the number of convex polyominoes of area n and degree of convexity at most 2 (the so-called Z-convex polyominoes) in polynomial ...
massazza
core +1 more source
Vision‐Based Dirt Detection and Adaptive Tiling Scheme for Selective Area Coverage
Journal of Sensors, Volume 2018, Issue 1, 2018., 2018 This paper proposes a visual dirt detection algorithm and a novel adaptive tiling‐based selective dirt area coverage scheme for reconfigurable morphology robot. The visual dirt detection technique utilizes a three‐layer filtering framework which includes a periodic pattern detection filter, edge detection, and noise filtering to effectively detect and ...
Balakrishnan Ramalingam +5 more
wiley +1 more source
Generalisation over Details: The Unsuitability of Supervised Backpropagation Networks for Tetris
Advances in Artificial Neural Systems, Volume 2015, Issue 1, 2015., 2015 We demonstrate the unsuitability of Artificial Neural Networks (ANNs) to the game of Tetris and show that their great strength, namely, their ability of generalization, is the ultimate cause. This work describes a variety of attempts at applying the Supervised Learning approach to Tetris and demonstrates that these approaches (resoundedly) fail to ...
Ian J. Lewis +2 more
wiley +1 more source
Some Inverse Relations Determined by Catalan Matrices
International Journal of Combinatorics, Volume 2013, Issue 1, 2013., 2013 We use the A‐sequence and Z‐sequence of Riordan array to characterize the inverse relation associated with the Riordan array. We apply this result to prove some combinatorial identities involving Catalan matrices and binomial coefficients. Some matrix identities obtained by Shapiro and Radoux are all special cases of our identity.
Sheng-liang Yang, Laszlo A. Szekely
wiley +1 more source
Polyominoes on twisted cylinders [PDF]
Proceedings of the 29th annual symposium on Symposuim on computational geometry - SoCG '13, 2013 In this video we show how to enumerate polyominoes on twisted cylinders, and explain how to use them for setting lower bounds on the asymptotic growth rate of polyominoes in the plane.
Gill Barequet, Mira Shalah
openaire +1 more source
Fixed Parameter Undecidability for Wang Tilesets [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Deciding if a given set of Wang tiles admits a tiling of the plane is decidable if the number of Wang tiles (or the number of colors) is bounded, for a trivial reason, as there are only finitely many such tilesets.
Emmanuel Jeandel, Nicolas Rolin
doaj +1 more source
Log‐balanced combinatorial sequences
International Journal of Mathematics and Mathematical Sciences, Volume 2005, Issue 4, Page 507-522, 2005., 2005 We consider log‐convex sequences that satisfy an additional constraint imposed on their rate of growth. We call such sequences log‐balanced. It is shown that all such sequences satisfy a pair of double inequalities. Sufficient conditions for log‐balancedness are given for the case when the sequence satisfies a two‐ (or more‐) term linear recurrence. It
Tomislav Došlić
wiley +1 more source