Results 71 to 80 of about 11,854 (238)
Construction of Bernstein‐Based Words and Their Patterns
ABSTRACT In this paper, with inspiration of the definition of Bernstein basis functions and their recurrence relation, we give construction of a new word family that we refer Bernstein‐based words. By classifying these special words as the first and second kinds, we investigate their some fundamental properties involving periodicity and symmetricity ...
Irem Kucukoglu, Yilmaz Simsek
wiley +1 more source
Enumerating Stable Nanopores in Graphene and their Geometrical Properties Using the Combinatorics of Hexagonal Lattices [PDF]
Sneha Thomas +2 more
openalex +1 more source
Quantification and Determination of Compatible Bacterial Consortia
This study presents a mathematical model to identify compatible bacterial consortia by analysing antagonistic and coexistence relationships. Introducing the Bacterial Coexistence Index (BCI), it evaluates bacterial viability. The model identified 36,851 strain sets promoting plant growth, optimising bacterial consortium design for sustainable ...
Jair J. Pineda‐Pineda +4 more
wiley +1 more source
Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions
Boltzmann sampling is commonly used to uniformly sample objects of a particular size from large combinatorial sets. For this technique to be effective, one needs to prove that (1) the sampling procedure is efficient and (2) objects of the desired size ...
Bernstein, Megan +2 more
core +1 more source
Conformal Hypergraphs: Duality and Implications for the Upper Clique Transversal Problem
ABSTRACT Given a hypergraph ℋ, the dual hypergraph of ℋ is the hypergraph of all minimal transversals of ℋ. The dual hypergraph is always Sperner, that is, no hyperedge contains another. A special case of Sperner hypergraphs are the conformal Sperner hypergraphs, which correspond to the families of maximal cliques of graphs.
Endre Boros +3 more
wiley +1 more source
A Survey of Alternating Permutations [PDF]
This survey of alternating permutations and Euler numbers includes refinements of Euler numbers, other occurrences of Euler numbers, longest alternating subsequences, umbral enumeration of classes of alternating permutations, and the cd-index of the ...
Stanley, Richard P.
core +1 more source
Enumerative Combinatorics of Simplicial and Cell Complexes: Kirchhoff and Trent Type Theorems [PDF]
Sylvain E. Cappell, Edward Y. Miller
openalex +2 more sources
Sequentially Constrained Hamilton Cycles in Random Graphs
ABSTRACT We discuss the existence of Hamilton cycles in the random graph Gn,p$$ {G}_{n,p} $$ where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order, and (iii) there is a bound on the number of inversions in the associated permutation.
Alan Frieze, Wesley Pegden
wiley +1 more source
DeepQR: single‐molecule QR codes for optical gene‐expression analysis
Abstract Optical imaging and single‐molecule imaging, in particular, utilize fluorescent tags in order to differentiate observed species by color. The degree of color multiplexing is dependent on the available spectral detection window and the ability to distinguish between fluorophores of different colors within this window.
Jonathan Jeffet +9 more
wiley +1 more source
Enumerative combinatorics on words [PDF]
Generating series, also called generating functions, play an important role in combinatorial mathematics. Many enumeration problems can be solved by transferring the basic operations on sets into algebraic operations on formal series leading to a solution of an enumeration problem.
openaire +2 more sources

