Imagen de Portada

Counting Spinal Tree-Child Networks via Word Encodings and Generating Functions

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Vives, Pau, de Mier, Anna, Cardona, Gabriel, Pons, Joan Carles
Formato:	Preprint
Publicado:	2026
Materias:	Combinatorics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A $μ$-distance for semidirected orchard phylogenetic networks
por: Ribas, Gerard, et al.
Publicado: (2026)

A construction that preserves the configuration of a matroid, with applications to lattice path matroids
por: Bonin, Joseph E., et al.
Publicado: (2025)

The Lattice of Cyclic Flats of a Matroid
por: Bonin, Joseph E., et al.
Publicado: (2005)

Lattice Path Matroids: Structural Properties
por: Bonin, Joseph E., et al.
Publicado: (2004)

Counting independent sets in percolated graphs via the Ising model
por: Geisler, Anna, et al.
Publicado: (2025)

Counting cospectral graphs obtained via switching
por: Abiad, Aida, et al.
Publicado: (2025)

Fence decompositions and cherry covers in non-binary phylogenetic networks
por: Pons, Joan Carles, et al.
Publicado: (2024)

Characterizations of transversal and fundamental transversal matroids
por: Bonin, Joseph E., et al.
Publicado: (2010)

Word Chain Generators for Prefix Normal Words
por: Adamson, Duncan, et al.
Publicado: (2025)

Finite versus uncountable convex lattices from point configurations
por: Cardó, Carles
Publicado: (2026)

Lattice path matroids: enumerative aspects and Tutte polynomials
por: Bonin, Joseph E., et al.
Publicado: (2002)

Counting independent sets in expanding bipartite regular graphs
por: Collares, Maurício, et al.
Publicado: (2025)

Counting cherry reduction sequences is counting linear extensions (in phylogenetic tree-child networks)
por: Coronado, Tomás M., et al.
Publicado: (2024)

Counting (and Randomly Generating) Hamiltonian Cycles in Rectangular Grids
por: Blanco, Pablo, et al.
Publicado: (2026)

Square-free Word-representation of Word-representable Graphs
por: Das, Biswajit, et al.
Publicado: (2024)

Counting homomorphisms in antiferromagnetic graphs via Lorentzian polynomials
por: Lee, Joonkyung, et al.
Publicado: (2025)

Exhaustive Generation of Pattern-Avoiding s-Words
por: Buick, Samuel, et al.
Publicado: (2025)

Counting Lattice Points in Generalized Permutohedra From A to B
por: Thawinrak, Warut
Publicado: (2025)

Deficit and $(q,t)$-symmetry in triangular partitions
por: Pons, Viviane, et al.
Publicado: (2026)

Counting graphic sequences via integrated random walks
por: Balister, Paul, et al.
Publicado: (2023)

Counting quadrant walks via Tutte's invariant method
por: Bernardi, Olivier, et al.
Publicado: (2017)

Tensor Product of Polymatroids and Common Information
por: Padró, Carles
Publicado: (2025)

Moderate Deviations of Triangle Counts in the Erdős-Rényi Random Graph $G(n,m)$: The Lower Tail
por: Alvarado, José, et al.
Publicado: (2024)

Counting Triangles in Triangles
por: Propp, Jim, et al.
Publicado: (2024)

Counting permutations with no long monotone subsequence via generating trees and the kernel method
por: Bousquet-Mélou, Mireille
Publicado: (2010)

A Class of Unrooted Phylogenetic Networks Inspired by the Properties of Rooted Tree-Child Networks
por: van Iersel, Leo, et al.
Publicado: (2026)

Counting Permutation Patterns with Multidimensional Trees
por: Beniamini, Gal, et al.
Publicado: (2024)

Succinct Encodings of Binary Trees with Application to AVL Trees
por: Chizewer, Jeremy, et al.
Publicado: (2023)

Derangements and Generalizations: A Counting Note on the Matching Problem
por: Luciano, Antoine
Publicado: (2025)

Counting Subnetworks Under Gene Duplication in Genetic Regulatory Networks
por: Scruse, Ashley, et al.
Publicado: (2024)

Counting degree-constrained orientations
por: Yu, Jing, et al.
Publicado: (2025)

Matchings with Prescribed Color Counts
por: Popescu, Tudor
Publicado: (2025)

Counting cycles in planar triangulations
por: Lo, On-Hei Solomon, et al.
Publicado: (2022)

Counting triangles in regular graphs
por: He, Jialin, et al.
Publicado: (2023)

Galled Tree-Child Networks
por: Chang, Yu-Sheng, et al.
Publicado: (2024)

Word-representability of co-bipartite graph
por: Das, Biswajit, et al.
Publicado: (2025)

Graphs of Reduced Words and Some Connections
por: Adeyemo, Praise
Publicado: (2024)

Counting quadrant walks via Tutte's invariant method (extended abstract)
por: Bernardi, O, et al.
Publicado: (2015)

Constructing Optimal Kobon Triangle Arrangements via Table Encoding, SAT Solving, and Heuristic Straightening
por: Savchuk, Pavlo
Publicado: (2025)

Approximate Counting in Local Lemma Regimes
por: Mann, Ryan L., et al.
Publicado: (2025)