Results 81 to 90 of about 70,780 (208)

Simple 3‐Designs of PSL ( 2 , 2 n ) With Block Size 13

open access: yesJournal 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

Efficient estimation of the cardinality of large data sets [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2006
Giroire has recently proposed an algorithm which returns the $\textit{approximate}$ number of distinct elements in a large sequence of words, under strong constraints coming from the analysis of large data bases.
Philippe Chassaing, Lucas Gerin
doaj   +1 more source

Further applications of the Container Method

open access: yes, 2016
Recently, Balogh--Morris--Samotij and Saxton--Thomason proved that hypergraphs satisfying some natural conditions have only few independent sets. Their main results already have several applications.
Balogh, Jozsef, Wagner, Adam Zsolt
core   +1 more source

Dimer models and conformal structures

open access: yesCommunications on Pure and Applied Mathematics, Volume 79, Issue 2, Page 340-446, February 2026.
Abstract Dimer models have been the focus of intense research efforts over the last years. Our paper grew out of an effort to develop new methods to study minimizers or the asymptotic height functions of general dimer models and the geometry of their frozen boundaries.
Kari Astala   +3 more
wiley   +1 more source

Predecessor and Permutation Existence Problems for Sequential Dynamical Systems. [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2003
A class of finite discrete dynamical systems, called Sequential Dynamical Systems (SDSs), was introduced in [BR99] as a formal model for analyzing simulation systems.
Christopher L. Barrett   +5 more
doaj   +1 more source

On the Q‐Polynomial Property of Bipartite Graphs Admitting a Uniform Structure

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 2, Page 69-86, February 2026.
ABSTRACT Let Γ denote a finite, connected graph with vertex set X. Fix x ∈ X and let ε ≥ 3 denote the eccentricity of x. For mutually distinct scalars { θ i * } i = 0 ε define a diagonal matrix A * = A * ( θ 0 * , θ 1 * , … , θ ε * ) ∈ Mat X ( R ) as follows: for y ∈ X we let ( A * ) y y = θ ∂ ( x , y ) *, where ∂ denotes the shortest path length ...
Blas Fernández   +3 more
wiley   +1 more source

A complex network perspective on brain disease

open access: yesBiological Reviews, Volume 101, Issue 1, Page 364-399, February 2026.
ABSTRACT If brain anatomy and dynamics have a complex network structure as it has become standard to posit, it is reasonable to assume that such a structure should play a key role not only in brain function but also in brain dysfunction. However, exactly how network structure is implicated in brain damage and whether at least some pathologies can be ...
David Papo, Javier M. Buldú
wiley   +1 more source

Steiner Triple Systems With High Discrepancy

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 1, Page 5-14, January 2026.
ABSTRACT In this paper, we initiate the study of discrepancy questions for combinatorial designs. Specifically, we show that, for every fixed r ≥ 3 and n ≡ 1 , 3 ( mod 6 ), any r‐colouring of the triples on [ n ] admits a Steiner triple system of order n with discrepancy Ω ( n 2 ).
Lior Gishboliner   +2 more
wiley   +1 more source

Completing Multi‐Latin Rectangles via Factors With Prescribed Degrees in Bipartite Graphs

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 1, Page 31-36, January 2026.
ABSTRACT Let Q be an n × n array whose top left r × s sub‐array L is filled with a set of k different symbols such that each cell of L contains λ symbols. In this note, we find conditions under which each empty cell of Q can be filled with λ symbols in such a way that the total number of occurrences of each symbol is prescribed and that each symbol ...
Amin Bahmanian
wiley   +1 more source

New Difference Triangle Sets by a Field‐Programmable Gate Array‐Based Search Technique

open access: yesJournal of Combinatorial Designs, Volume 34, Issue 1, Page 37-50, January 2026.
ABSTRACT We provide some difference triangle sets with scopes that improve upon the best known values. These are found with purpose‐built digital circuits realized with field‐programmable gate arrays (FPGAs) rather than software algorithms running on general‐purpose processors.
Mohannad Shehadeh   +2 more
wiley   +1 more source

Home - About - Disclaimer - Privacy