Results 31 to 40 of about 132,418 (291)
Gog, Magog and Schützenberger II: left trapezoids [PDF]
Discrete Mathematics & Theoretical Computer Science, 2013 We are interested in finding an explicit bijection between two families of combinatorial objects: Gog and Magog triangles. These two families are particular classes of Gelfand-Tsetlin triangles and are respectively in bijection with alternating sign ...
Philippe Biane, Hayat Cheballah
doaj +1 more source
On Andrews’ Partitions with Parts Separated by Parity
Mathematics, 2021 In this paper, we present a generalization of one of the theorems in Partitions with parts separated by parity introduced by George E. Andrews, and give its bijective proof.
Abdulaziz M. Alanazi, Darlison Nyirenda
doaj +1 more source
The Ellis semigroup of bijective substitutions [PDF]
Groups, Geometry, and Dynamics, 2021 For topological dynamical systems (X,T,\sigma) with abelian group T , which admit an equicontinuous factor \pi:(X,T,\sigma)\to (Y,T,\delta) , the Ellis semigroup
Kellendonk, Johannes, Yassawi, Reem
openaire +5 more sources
Practical construction of globally injective parameterizations with positional constraints
Computational Visual Media, 2023 We propose a novel method to compute globally injective parameterizations with arbitrary positional constraints on disk topology meshes. Central to this method is the use of a scaffold mesh that reduces the globally injective constraint to a locally ...
Qi Wang +4 more
doaj +1 more source
Challenges in the Computational Modeling of the Protein Structure—Activity Relationship
Computation, 2021 Living organisms are composed of biopolymers (proteins, nucleic acids, carbohydrates and lipid polymers) that are used to keep or transmit information relevant to the state of these organisms at any given time. In these processes, proteins play a central
Gabriel Del Río
doaj +1 more source
Involve, a Journal of Mathematics, 2021 We investigate the dynamics of the well-known RSK bijection on permutations when iterated on various reading words of the recording tableau. In the setting of the ordinary (row) reading word, we show that there is exactly one fixed point per partition shape, and that it is always reached within two steps from any starting permutation.
Jacob Hocevar +3 more
openaire +3 more sources
A bijection between noncrossing and nonnesting partitions of types A and B [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 The total number of noncrossing partitions of type $\Psi$ is the $n$th Catalan number $\frac{1}{ n+1} \binom{2n}{n}$ when $\Psi =A_{n-1}$, and the binomial coefficient $\binom{2n}{n}$ when $\Psi =B_n$, and these numbers coincide with the correspondent ...
Ricardo Mamede
doaj +1 more source
Accessible and Deterministic Automata: Enumeration and Boltzmann Samplers [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 We present a bijection between the set $\mathcal{A}_n$ of deterministic and accessible automata with $n$ states on a $k$-letters alphabet and some diagrams, which can themselves be represented as partitions of the set $[\![ 1..(kn+1) ]\!]$ into $n$ non ...
Frédérique Bassino, Cyril Nicaud
doaj +1 more source
Bijection Between Oriented Maps and Weighted Non-Oriented Maps [PDF]
Electronic Journal of Combinatorics, 2016 We consider bicolored maps, i.e. graphs which are drawn on surfaces, and construct a bijection between (i) oriented maps with arbitary face structure, and (ii) (weighted) non-oriented maps with exactly one face.
A. Czyzewska-Jankowska, Piotr Śniady
semanticscholar +1 more source
On the SEL Egyptian fraction expansion for real numbers
AIMS Mathematics, 2022 In the authors' earlier work, the SEL Egyptian fraction expansion for any real number was constructed and characterizations of rational numbers by using such expansion were established.
Mayurachat Janthawee +1 more
doaj +1 more source