Results 71 to 80 of about 2,700,684 (210)
, 2009 Analytic Combinatorics is a self-contained treatment of the mathematics underlying the analysis of discrete structures, which has emerged over the past several decades as an essential tool in the understanding of properties of computer programs and ...
P. Flajolet, R. Sedgewick
semanticscholar +1 more source
Independent Sets of Random Trees and Sparse Random Graphs
Journal of Graph Theory, Volume 109, Issue 3, Page 294-309, July 2025.ABSTRACT An independent set of size k in a finite undirected graph G is a set of k vertices of the graph, no two of which are connected by an edge. Let x k ( G ) be the number of independent sets of size k in the graph G and let α ( G ) = max { k ≥ 0 : x k ( G ) ≠ 0 }. In 1987, Alavi, Malde, Schwenk, and Erdős asked if the independent set sequence x 0 (
Steven Heilman
wiley +1 more source
Polyominoes determined by permutations [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 In this paper we consider the class of $\textit{permutominoes}$, i.e. a special class of polyominoes which are determined by a pair of permutations having the same size. We give a characterization of the permutations associated with convex permutominoes,
I. Fanti +4 more
doaj +1 more source
Refuting conjectures in extremal combinatorics via linear programming [PDF]
arXiv, 2019 We apply simple linear programming methods and an LP solver to refute a number of open conjectures in extremal combinatorics.
arxiv
A Bayesian Proof of the Spread Lemma
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT A key set‐theoretic “spread” lemma has been central to two recent celebrated results in combinatorics: the recent improvements on the sunflower conjecture by Alweiss, Lovett, Wu, and Zhang; and the proof of the fractional Kahn–Kalai conjecture by Frankston, Kahn, Narayanan, and Park.
Elchanan Mossel +3 more
wiley +1 more source
Label-based parameters in increasing trees [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 Grown simple families of increasing trees are a subclass of increasing trees, which can be constructed by an insertion process. Three such tree families contained in the grown simple families of increasing trees are of particular interest: $\textit ...
Markus Kuba, Alois Panholzer
doaj +1 more source
Discrete Polynomials and Discrete Holomorphic Approximation [PDF]
arXiv, 2002 We use discrete holomorphic polynomials to prove that, given a refining sequence of critical maps of a Riemann surface, any holomorphic function can be approximated by a converging sequence of discrete holomorphic functions.
arxiv
Combinatorics of partial wreath power of finite inverse symmetric semigroup $\mathcal{IS}_d$ [PDF]
Algebra and Discrete Mathematics, Number 1. (2007). pp. 49 - 61, 2020 We study some combinatorial properties of partial wreath $k$-th power of the semigroup $\mathcal{IS}_d$. In particular, we calculate its order, the number of idempotents and the number of D-classes.
arxiv
Sparse graph signals – uncertainty principles and recovery
GAMM-Mitteilungen, Volume 48, Issue 2, June 2025.ABSTRACT We study signals that are sparse either on the vertices of a graph or in the graph spectral domain. Recent results on the algebraic properties of random integer matrices as well as on the boundedness of eigenvectors of random matrices imply two types of support size uncertainty principles for graph signals.
Tarek Emmrich +2 more
wiley +1 more source
Conditioned Galton-Watson trees do not grow [PDF]
Discrete Mathematics & Theoretical Computer Science, 2006 An example is given which shows that, in general, conditioned Galton-Watson trees cannot be obtained by adding vertices one by one, while this can be done in some important but special cases, as shown by Luczak and Winkler.
Svante Janson
doaj +1 more source