Results 51 to 60 of about 45,358 (192)

Species Identification in Drosophilids; the Utility of k‐mer Characters

open access: yesMolecular Ecology, Volume 35, Issue 21, November 2026.
ABSTRACT Over 14,900 COI DNA sequences of drosophilids were used to build a character‐based diagnostic system for the identification of genera and species in the group. This approach uses aligned COI sequence characters, k‐mer characters and applies a hybrid approach that combines the two.
Rob DeSalle
wiley   +1 more source

A q$q$‐analogue of graph independence polynomials with a group‐theoretic interpretation

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 11, November 2026.
Abstract We define totally‐isotropic space polynomials of alternating matrix spaces over finite fields, by analogy with independence polynomials of graphs. Our main result shows that totally‐isotropic space polynomials of graphical alternating matrix spaces give rise to a natural q$q$‐analogue of graph independence polynomials. For p$p$‐groups of class
Youming Qiao
wiley   +1 more source

Enumeration of finite dynamical systems with given number of leaves

open access: yesAKCE International Journal of Graphs and Combinatorics
The number of leaves in a dynamical system’s functional graph is a crucial combinatorial invariant, directly encoding the cardinality of the system’s image and reflecting its non-injectivity.
Nader Jafari Rad, Behruz Raesi
doaj   +1 more source

On automorphism groups of metric reduced products of symmetric groups

open access: yesBulletin of the London Mathematical Society, Volume 58, Issue 10, October 2026.
Abstract We study isomorphisms between metric reduced products of symmetric groups with the normalized Hamming metric assuming the open coloring axiom OCA${\mathsf {OCA}}$ and Martin's axiom for σ$\sigma$‐linked posets.
Ben De Bondt, Andreas Thom
wiley   +1 more source

C-Finite Sequences and Riordan Arrays

open access: yesMathematics
Many prominent combinatorial sequences, such as the Fibonacci, Lucas, Pell, Jacobsthal and Tribonacci sequences, are defined by homogeneous linear recurrence relations with constant coefficients.
Donatella Merlini
doaj   +1 more source

Machine Learning for Synthetic Organic Chemistry: Methods, Applications, and Best Practices

open access: yesAngewandte Chemie Novit, Volume 2, Issue 3, September 2026.
Artificial intelligence (AI) and machine learning (ML) are increasingly reshaping experimental chemistry. This review maps the challenges of synthetic organic chemistry to modern digital tools that can help address them. While focusing on the practical application of ML tools in real‐world laboratory settings, we outline prerequisites, emerging ...
Niklas Hölter   +3 more
wiley   +1 more source

Cyclic derangements [PDF]

open access: yes, 2010
A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we generalize this problem
Sami H. Assaf, Assaf, Sami H.
core   +1 more source

Software for enumerative and analytic combinatorics

open access: yesCoRR, 2016
We survey some general-purpose symbolic software packages that implement algorithms from enumerative and analytic combinatorics. Software for the following areas is covered: basic combinatorial objects, symbolic combinatorics, Pólya theory, combinatorial species, and asymptotics.
openaire   +2 more sources

Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices

open access: yesJournal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.
ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová   +3 more
wiley   +1 more source

Majority Dynamics on Finite Trees

open access: yesRandom Structures &Algorithms, Volume 69, Issue 2, September 2026.
ABSTRACT For an arbitrary finite tree T$$ T $$, we find the exact value of the worst‐case stabilization time of majority dynamics on T$$ T $$. We also prove that for a perfect rooted cubic tree T$$ T $$ with diameter D$$ D $$ and uniformly random initial opinions, the dynamics stabilizes in time τ∈(D/4,D/3)$$ \tau \in \left(D/4,D/3\right) $$ with high ...
Itai Benjamini   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy