Results 11 to 20 of about 642,707 (262)

Antisquares and Critical Exponents [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2023
The (bitwise) complement $\overline{x}$ of a binary word $x$ is obtained by changing each $0$ in $x$ to $1$ and vice versa. An $\textit{antisquare}$ is a nonempty word of the form $x\, \overline{x}$.
Aseem Baranwal   +5 more
doaj   +1 more source

Catalan fragile words [PDF]

open access: yesInternational Journal of Group Theory, 2020
‎Fragile words have been already considered in the context of automata groups‎. ‎Here we focus our attention on a special class of strongly fragile words that we call Catalan fragile words‎.
Daniele D'Angeli   +2 more
doaj   +1 more source

Enumeration of Binary Trees and Universal Types [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2005
Binary unlabeled ordered trees (further called binary trees) were studied at least since Euler, who enumerated them. The number of such trees with n nodes is now known as the Catalan number.
Charles Knessl, Wojciech Szpankowski
doaj   +3 more sources

Alternative formulations to compute the binary shape Euler number

open access: yesIET Computer Vision, 2014
The authors propose two equations based on the pixel geometry and connectivity properties, which can be used to compute, efficiently, the Euler number of a binary digital image with either thick or thin boundaries.
Juan Humberto Sossa Azuela   +5 more
doaj   +1 more source

Congruences for the Apéry numbers modulo p³ [PDF]

open access: yesNotes on Number Theory and Discrete Mathematics
Let {Aₙ'} be the Apéry numbers given by Aₙ'=\Σⁿₖ₌ₒ$binom{n}{k}$²$binom{n+k}{k}$. For any prime p≡3 (mod 4) we show that A'_{(p-1)/2}≡p²/3$binom{(p-3)/2}{(p-3)/4}$² (mod p³). Let {tₙ} be given by t₀=1, t₁=5 and tₙ₊₁=(8n²+12n+5)tₙ-4n²(2n+1)²tₙ₋₁ (n≥1).
Zhi-Hong Sun
doaj   +1 more source

Modeling the travel distances of debris flows and debris slides: quantifying hillside morphology [PDF]

open access: yesAnnals of Forest Research, 2011
A travel distance model for debris flows and slides is presented based on information collected in southeast British Columbia, Canada. The model incorporates a variable that represents terrain morphology by a single number, quantification made using a ...
Bogdan Strimbu
doaj   +3 more sources

Simple binary segmentation frameworks for identifying variation in DNA copy number

open access: yesBMC Bioinformatics, 2012
Background Variation in DNA copy number, due to gains and losses of chromosome segments, is common. A first step for analyzing DNA copy number data is to identify amplified or deleted regions in individuals.
Yang Tae Young
doaj   +1 more source

On trees, tanglegrams, and tangled chains [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2020
Tanglegrams are a class of graphs arising in computer science and in biological research on cospeciation and coevolution. They are formed by identifying the leaves of two rooted binary trees. The embedding of the trees in the plane is irrelevant for this
Sara Billey   +2 more
doaj   +1 more source

Complex Number Representation in RCBNS Form for Arithmetic Operations and Conversion of the Result into Standard Binary Form [PDF]

open access: yesJournal of Systemics, Cybernetics and Informatics, 2004
paper introduces a novel method for complex number representation. The proposed Redundant Complex Binary Number System (RCBNS) is developed by combining a Redundant Binary Number and a complex number in base (-1+j).
Hatim Zaini, R. G. Deshmukh
doaj  

RepB C-terminus mutation of a pRi-repABC binary vector affects plasmid copy number in Agrobacterium and transgene copy number in plants. [PDF]

open access: yesPLoS ONE, 2018
A native repABC replication origin from pRiA4b was previously reported as a single copy plasmid in Agrobacterium tumefaciens and can improve the production of transgenic plants with a single copy insertion of transgenes when it is used in binary vectors ...
Zarir Vaghchhipawala   +7 more
doaj   +1 more source

Home - About - Disclaimer - Privacy