Results 1 to 10 of about 148 (139)

Symmetry and Correspondence of Algorithmic Complexity over Geometric, Spatial and Topological Representations [PDF]

open access: yesEntropy, 2018
We introduce a definition of algorithmic symmetry in the context of geometric and spatial complexity able to capture mathematical aspects of different objects using as a case study polyominoes and polyhedral graphs.
Hector Zenil   +2 more
doaj   +2 more sources

Tiling a Rectangle with Polyominoes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2003
A polycube in dimension $d$ is a finite union of unit $d$-cubes whose vertices are on knots of the lattice $\mathbb{Z}^d$. We show that, for each family of polycubes $E$, there exists a finite set $F$ of bricks (parallelepiped rectangles) such that the ...
Olivier Bodini
doaj   +4 more sources

A molecular T-pentomino for separating BTEX hydrocarbons [PDF]

open access: yesNature Communications
Methods to separate molecules (e.g., petrochemicals) are exceedingly important industrially. A common approach for separations is to crystallize a host molecule that either provides an enforced covalent cavity (intrinsic cavity) or packs inefficiently ...
Christopher J. Hartwick   +2 more
doaj   +2 more sources

Folding polyominoes into cubes

open access: yesJournal of Computational Geometry
Which polyominoes can be folded into a cube, using only creases along edges of the square lattice underlying the polyomino, with fold angles of ±90° and ±180°, and allowing faces of the cube to be covered multiple times?
Oswin Aichholzer   +2 more
doaj   +3 more sources

The number of $k$-parallelogram polyominoes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2013
A convex polyomino is $k$-$\textit{convex}$ if every pair of its cells can be connected by means of a $\textit{monotone path}$, internal to the polyomino, and having at most $k$ changes of direction.
Daniela Battaglino   +3 more
doaj   +1 more source

The Laplacian Spectrum, Kirchhoff Index, and the Number of Spanning Trees of the Linear Heptagonal Networks

open access: yesComplexity, Volume 2022, Issue 1, 2022., 2022
Let Hn be the linear heptagonal networks with 2n heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian polynomial of Hn, we utilize the method of decompositions. Thus, the Laplacian spectrum of Hn is created by eigenvalues of a pair of matrices: LA and LS of order numbers 5n + 1 ...
Jia-Bao Liu   +4 more
wiley   +1 more source

Enumeration of minimal 3D polyominoes inscribed in a rectangular prism [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
We consider the family of 3D minimal polyominoes inscribed in a rectanglar prism. These objects are polyominos and so they are connected sets of unitary cubic cells inscribed in a given rectangular prism of size $b\times k \times h$ and of minimal volume
Alain Goupil, Hugo Cloutier
doaj   +1 more source

Support Personalized Weighted Local Differential Privacy Skyline Query

open access: yesSecurity and Communication Networks, Volume 2022, Issue 1, 2022., 2022
The potential privacy risks in certain situations are of concern because of the frequent sharing of data during skyline queries, leading to leakage of users’ private information. The most common privacy‐preserving technique is to anonymize data by removing or changing certain information, for which an attack with specific background knowledge would ...
Guopeng Zhang   +4 more
wiley   +1 more source

The number of directed $k$-convex polyominoes [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2015
We present a new method to obtain the generating functions for directed convex polyominoes according to several different statistics including: width, height, size of last column/row and number of corners.
Adrien Boussicault   +2 more
doaj   +1 more source

A Size‐Perimeter Discrete Growth Model for Percolation Clusters

open access: yesComplexity, Volume 2021, Issue 1, 2021., 2021
Cluster growth models are utilized for a wide range of scientific and engineering applications, including modeling epidemics and the dynamics of liquid propagation in porous media. Invasion percolation is a stochastic branching process in which a network of sites is getting occupied that leads to the formation of clusters (group of interconnected ...
Bendegúz Dezső Bak   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy