Results 141 to 150 of about 221,378 (266)
Putatively Optimal Projective Spherical Designs With Little Apparent Symmetry
Journal of Combinatorial Designs, Volume 33, Issue 6, Page 222-234, June 2025.ABSTRACT We give some new explicit examples of putatively optimal projective spherical designs, that is, ones for which there is numerical evidence that they are of minimal size. These form continuous families, and so have little apparent symmetry in general, which requires the introduction of new techniques for their construction.
Alex Elzenaar, Shayne Waldron
wiley +1 more source
BarekengThe rainbow connection was first introduced by Chartrand in 2006 and then in 2009 Krivelevich and Yuster first time introduced the rainbow vertex connection. Let graph be a connected graph.
Muhammad Ilham Nurfaizi Annadhifi +3 more
doaj +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
Rainbow Connection Number of Dense Graphs
Discussiones Mathematicae Graph Theory, 2013 An edge-colored graph G is rainbow connected, if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a connected graph G, denoted rc(G), is the smallest number of colors that are needed in order to ...
Li Xueliang +2 more
doaj +1 more source
Invariants of Combinatorial Line Arrangements and Rybnikov's Example
, 2004 Following the general strategy proposed by G.Rybnikov, we present a proof of his well-known result, that is, the existence of two arrangements of lines having the same combinatorial type, but non-isomorphic fundamental groups.
Artal, E. +3 more
core
Recent developments in algebraic combinatorics [PDF]
arXiv, 2002 A survey of three recent developments in algebraic combinatorics: (1) the Laurent phenomenon, (2) Gromov-Witten invariants and toric Schur functions, and (3) toric h-vectors and intersection cohomology. This paper is a continuation of "Recent progress in algebraic combinatorics" (math.CO/0010218), which dealt with three other topics.
arxiv
On an Erdős similarity problem in the large
Bulletin of the London Mathematical Society, Volume 57, Issue 6, Page 1801-1818, June 2025.Abstract In a recent paper, Kolountzakis and Papageorgiou ask if for every ε∈(0,1]$\epsilon \in (0,1]$, there exists a set S⊆R$S \subseteq \mathbb {R}$ such that |S∩I|⩾1−ε$\vert S \cap I\vert \geqslant 1 - \epsilon$ for every interval I⊂R$I \subset \mathbb {R}$ with unit length, but that does not contain any affine copy of a given increasing sequence ...
Xiang Gao +2 more
wiley +1 more source
Some asymptotic methods in combinatorics [PDF]
, 1979 J. M. Plotkin, John W. Rosenthal
openalex +1 more source
Combinatorics and geometry of Littlewood-Richardson cones [PDF]
arXiv, 2004 We present several direct bijections between different combinatorial interpretations of the Littlewood-Richardson coefficients. The bijections are defined by explicit linear maps which have other applications.
arxiv
Structure of hyperbolic polynomial automorphisms of C2${\mathbb {C}^2}$ with disconnected Julia sets
Proceedings of the London Mathematical Society, Volume 130, Issue 6, June 2025.Abstract For a hyperbolic polynomial automorphism of C2$\mathbb {C}^2$ with a disconnected Julia set, and under a mild dissipativity condition, we give a topological description of the components of the Julia set. Namely, there are finitely many “quasi‐solenoids” that govern the asymptotic behavior of the orbits of all nontrivial components.
Romain Dujardin, Mikhail Lyubich
wiley +1 more source