Image de couverture de livre

The Ultimate Signs of Second-Order Holonomic Sequences

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hagihara, Fugen, Kawamura, Akitoshi
Format:	Preprint
Publié:	2025
Sujets:	Discrete Mathematics 68R06 G.2.m; F.2.2
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

General Strong Bound on the Uncrossed Number via a Tight Bound for the Maximum Uncrossed Subgraph Number
par: Charvy, Gaspard, et autres
Publié: (2025)

Minimizing an Uncrossed Collection of Drawings
par: Hliněný, Petr, et autres
Publié: (2023)

On the Uncrossed Number of Graphs
par: Balko, Martin, et autres
Publié: (2024)

Three iterations of $(d-1)$-WL test distinguish non isometric clouds of $d$-dimensional points
par: Rose, Valentino Delle, et autres
Publié: (2023)

Searching in trees with monotonic query times
par: Dereniowski, Dariusz, et autres
Publié: (2024)

Greedy Sets and Greedy Numerical Semigroups
par: Pérez-Rosés, Hebert, et autres
Publié: (2024)

Graphs whose vertices of degree at least 2 lie in a triangle
par: Forte, Vinicius L. do, et autres
Publié: (2022)

Interval Graphs are Reconstructible
par: Heinrich, Irene, et autres
Publié: (2025)

The vehicle routing problem with synchronization constraints and support vehicle-dependent service times
par: Wittwer, David, et autres
Publié: (2024)

Fast winning strategies for the attacker in eternal domination
par: Bagan, Guillaume, et autres
Publié: (2024)

A framework for distributed discrete evacuation strategies
par: Borowiecki, Piotr, et autres
Publié: (2025)

Independent Set Enumeration in King Graphs by Tensor Network Contractions
par: Liang, Kai
Publié: (2025)

Completely independent spanning trees in the hypercube
par: Shaw, Benedict Randall
Publié: (2024)

Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
par: Cavallaro, Dario, et autres
Publié: (2026)

Determining Factorial Speed Fast
par: Feng, Zhidan, et autres
Publié: (2026)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
par: Laekhanukit, Bundit
Publié: (2024)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
par: Gabryelski, Wojciech, et autres
Publié: (2026)

Searching by Heterogeneous Agents
par: Dereniowski, Dariusz, et autres
Publié: (2021)

Some Counterexamples for Compatible Triangulations
par: Barnson, Cody, et autres
Publié: (2016)

Measuring well quasi-ordered finitary powersets
par: Abriola, Sergio, et autres
Publié: (2023)

Metrics on Permutation Families Defined by a Restriction Graph
par: Tymoshenko, Danylo, et autres
Publié: (2025)

On the thinness of trees
par: Bonomo-Braberman, Flavia, et autres
Publié: (2025)

Folding One Polyhedral Metric Graph into Another
par: Chung, Lily, et autres
Publié: (2024)

Adjacency Labeling Schemes for Small Classes
par: Bonnet, Édouard, et autres
Publié: (2024)

Thick Forests
par: Dyer, Martin, et autres
Publié: (2023)

Pliability and Approximating Max-CSPs
par: Romero, Miguel, et autres
Publié: (2019)

An Improved Drift Theorem for Balanced Allocations
par: Los, Dimitrios, et autres
Publié: (2023)

Bounds on the Twin-Width of Product Graphs
par: Pettersson, William, et autres
Publié: (2022)

A Systematic Approach to Crossing Numbers of Cartesian Products with Paths
par: Asiri, Zayed, et autres
Publié: (2024)

Counting Kernels in Directed Graphs with Arbitrary Orientations
par: Jartoux, Bruno
Publié: (2022)

De Bruijn Sequences with Minimum Discrepancy
par: Álvarez, Nicolás, et autres
Publié: (2024)

Improving the Crossing Lemma by Characterizing Dense 2-Planar and 3-Planar Graphs
par: Büngener, Aaron, et autres
Publié: (2024)

On the spectra of prefix-reversal graphs
par: Blanco, Saúl A., et autres
Publié: (2025)

Adjacent vertex distinguishing total coloring of 3-degenerate graphs
par: Behera, Diptimaya, et autres
Publié: (2025)

Some integer values in the spectra of burnt pancake graphs
par: Blanco, Saúl A., et autres
Publié: (2024)

Exploration of $k$-edge-deficient temporal graphs in linear time
par: Lahtin, Ivan, et autres
Publié: (2026)

Boolean combinations of graphs
par: Adenwalla, Sarosh, et autres
Publié: (2024)

Temporalizing digraphs via linear-size balanced bi-trees
par: Bessy, Stéphane, et autres
Publié: (2023)

The classification of minimally unsatisfiable 2-CNFs -- a fundamental study
par: Abbasizanjani, Hoda, et autres
Publié: (2020)

Excluding a Ladder as an Induced Minor in Graphs Without Induced Stars
par: Choi, Mujin, et autres
Publié: (2025)