Results 71 to 80 of about 11,738 (234)
ENUMERATIVE COMBINATORICS AND CODING THEORY
, 1994 The author develops a new method of investigation of combinatorial problems, introducing the value enumerator \(V_ f(T)= \sum_ p T^{f(p)}\in \mathbb{N}[T,T^{-1}]\) \((p\in \{1,-1\}^ n)\) for a certain polynomial \(f\) in \(n\) variables with non-negative integral coefficients. The coefficient of \(T^ v\) is the number of binary points \(p\) such that \(
openaire +3 more sources
Sequentially Constrained Hamilton Cycles in Random Graphs
Random Structures &Algorithms, Volume 67, Issue 1, August 2025.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
Analyzing Boltzmann Samplers for Bose-Einstein Condensates with Dirichlet Generating Functions
, 2017 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
Canonical Labeling of Latin Squares in Average‐Case Polynomial Time
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT A Latin square of order n$$ n $$ is an n×n$$ n\times n $$ matrix in which each row and column contains each of n$$ n $$ symbols exactly once. For ε>0$$ \varepsilon >0 $$, we show that with high probability a uniformly random Latin square of order n$$ n $$ has no proper subsquare of order larger than n1/2log1/2+εn$$ {n}^{1/2}{\log}^{1/2 ...
Michael J. Gill +2 more
wiley +1 more source
Optimal Zero‐Free Regions for the Independence Polynomial of Bounded Degree Hypergraphs
Random Structures &Algorithms, Volume 66, Issue 4, July 2025.ABSTRACT In this paper, we investigate the distribution of zeros of the independence polynomial of hypergraphs of maximum degree Δ$$ \Delta $$. For graphs, the largest zero‐free disk around zero was described by Shearer as having radius λs(Δ)=(Δ−1)Δ−1/ΔΔ$$ {\lambda}_s\left(\Delta \right)={\left(\Delta -1\right)}^{\Delta -1}/{\Delta}^{\Delta ...
Ferenc Bencs, Pjotr Buys
wiley +1 more source
Coloured shuffle compatibility, Hadamard products, and ask zeta functions
Bulletin of the London Mathematical Society, Volume 57, Issue 7, Page 2132-2154, July 2025.Abstract We devise an explicit method for computing combinatorial formulae for Hadamard products of certain rational generating functions. The latter arise naturally when studying so‐called ask zeta functions of direct sums of modules of matrices or class‐ and orbit‐counting zeta functions of direct products of nilpotent groups.
Angela Carnevale +2 more
wiley +1 more source
Moduli of finite flat torsors over nodal curves
Journal of the London Mathematical Society, Volume 112, Issue 1, July 2025.Abstract We show that log flat torsors over a family X/S$X/S$ of nodal curves under a finite flat commutative group scheme G/S$G/S$ are classified by maps from the Cartier dual of G$G$ to the log Jacobian of X$X$. We deduce that fppf torsors on the smooth fiberss of X/S$X/S$ can be extended to global log flat torsors under some regularity hypotheses.
Sara Mehidi, Thibault Poiret
wiley +1 more source
A Survey of Alternating Permutations [PDF]
, 2009 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
WIREs Computational Statistics, Volume 17, Issue 2, June 2025.A four‐run orthogonal array for three two‐level factors. ABSTRACT Orthogonal arrays are arguably one of the most fascinating and important statistical tools for efficient data collection. They have a simple, natural definition, desirable properties when used as fractional factorials, and a rich and beautiful mathematical theory.
C. Devon Lin, John Stufken
wiley +1 more source
Enumerative combinatorics, representations and quasisymmetric functions
, 2022 Η παρούσα διατριβή αποτελείται ουσιαστικά από δυο μέρη με κύριο πρωταγωνιστή τις χρωματισμένες quasi-συμμετρικές συναρτήσεις. Το 1984 ο Gessel εισήγαγε τις quasi-συμμετρικές συναρτήσεις, μια γενίκευση των συμμετρικών συναρτήσεων. Έπειτα, το 1993, μαζί με τον Reutenauer μελέτησαν εκτιμήσεις διάφορων quasi-συμμετρικών συναρτήσεων που σχετίζονται με ...
openaire +2 more sources