Results 41 to 50 of about 11,687 (142)
Simple 3‐Designs of PSL ( 2 , 2 n ) With Block Size 13
Journal of Combinatorial Designs, Volume 34, Issue 3, Page 119-138, March 2026.ABSTRACT This paper focuses on the investigation of simple 3‐( 2 n + 1 , 13 , λ ) designs admitting PSL ( 2 , 2 n ) as an automorphism group. Such designs arise from the orbits of 13‐element subsets under the action of PSL ( 2 , 2 n ) on the projective line X = GF ( 2 n ) ∪ { ∞ }, and any union of these orbits also forms a 3‐design.
Takara Kondo, Yuto Nogata
wiley +1 more source
Solving a Random Asymmetric TSP Exactly in Quasi‐Polynomial Time W.H.P.
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT Let the costs C(i,j)$$ C\left(i,j\right) $$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a nonnegative random variable C$$ C $$ from a class of distributions that include the uniform [0,1]$$ \left[0,1\right] $$ distribution and the exponential mean 1 distribution with mean 1.
Tolson Bell, Alan M. Frieze
wiley +1 more source
Enumerative properties of generalized associahedra
, 2004 Some enumerative aspects of the fans, called generalized associahedra, introduced by S. Fomin and A. Zelevinsky in their theory of cluster algebras are considered, in relation with a bicomplex and its two spectral sequences.
Chapoton, Frederic
core +3 more sources
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
Schubert varieties, linear codes and enumerative combinatorics
Finite Fields and Their Applications, 2005 We consider linear error correcting codes associated to higher dimensional projective varieties defined over a finite field. The problem of determining the basic parameters of such codes often leads to some interesting and difficult questions in combinatorics and algebraic geometry.
Sudhir R. Ghorpade, Michael A. Tsfasman
openaire +3 more sources
Algebraic and Geometric Methods in Enumerative Combinatorics [PDF]
, 2015 A survey written for the upcoming "Handbook of Enumerative Combinatorics".
openaire +2 more sources
Enumerative combinatorics on words [PDF]
, 2001 Generating series, also called generating functions, play an important role in combinatorial mathematics. Many enumeration problems can be solved by transferring the basic operations on sets into algebraic operations on formal series leading to a solution of an enumeration problem.
openaire +2 more sources
The Eulerian distribution on the involutions of the hyperoctahedral group is unimodal
, 2018 The Eulerian distribution on the involutions of the symmetric group is unimodal, as shown by Guo and Zeng. In this paper we prove that the Eulerian distribution on the involutions of the hyperoctahedral group, when viewed as a colored permutation group ...
Moustakas, Vassilis-Dionyssis P.
core
Enumeration of binary trees compatible with a perfect phylogeny. [PDF]
J Math Biol, 2022 Palacios JA +3 more
europepmc +1 more source
Spectral Decomposition of Discrepancy Kernels on the Euclidean Ball, the Special Orthogonal Group, and the Grassmannian Manifold. [PDF]
Constr Approx, 2023 Dick J +3 more
europepmc +1 more source