Results 51 to 60 of about 11,631 (230)
Estimates on the decay of the Laplace–Pólya integral
Bulletin of the London Mathematical Society, EarlyView.Abstract The Laplace–Pólya integral, defined by Jn(r)=1π∫−∞∞sincntcos(rt)dt$J_n(r) = \frac{1}{\pi }\int _{-\infty }^\infty \operatorname{sinc}^n t \cos (rt) \,\mathrm{d}t$, appears in several areas of mathematics. We study this quantity by combinatorial methods; accordingly, our investigation focuses on the values at integer rs$r{\rm s}$.
Gergely Ambrus, Barnabás Gárgyán
wiley +1 more source
, 2010 A classic problem in enumerative combinatorics is to count the number of derangements, that is, permutations with no fixed point. Inspired by a recent generalization to facet derangements of the hypercube by Gordon and McMahon, we generalize this problem
Assaf, Sami H.
core +3 more sources
Journal of Combinatorial Designs, Volume 33, Issue 10, Page 379-387, October 2025.ABSTRACT The E ( s 2 )‐optimal and minimax‐optimal supersaturated designs (SSDs) with 12 rows, 11 q columns, and s max = 4 are enumerated in a computer search: there are, respectively, 34, 146, 0, 3, and 1 such designs for q = 2 , 3 , 4 , 5, and 6. Cheng and Tang proved that for q > 6, there are no such SSDs.
Luis B. Morales
wiley +1 more source
Symmetric 2‐ ( 35 , 17 , 8 ) Designs With an Automorphism of Order 2
Journal of Combinatorial Designs, Volume 33, Issue 10, Page 399-403, October 2025.ABSTRACT The largest prime p that can be the order of an automorphism of a 2‐ ( 35 , 17 , 8 ) design is p = 17, and all 2‐ ( 35 , 17 , 8 ) designs with an automorphism of order 17 were classified by Tonchev. The symmetric 2‐ ( 35 , 17 , 8 ) designs with automorphisms of an odd prime order p < 17 were classified in Bouyukliev, Fack and Winne and ...
Sanja Rukavina, Vladimir D. Tonchev
wiley +1 more source
On the Structure of Bispecial Sturmian Words
, 2013 A balanced word is one in which any two factors of the same length contain the same number of each letter of the alphabet up to one. Finite binary balanced words are called Sturmian words.
Fici, Gabriele
core +1 more source
Strong External Difference Families and Classification of α‐Valuations
Journal of Combinatorial Designs, Volume 33, Issue 9, Page 343-356, September 2025.ABSTRACT One method of constructing ( a 2 + 1 , 2 , a , 1 )‐SEDFs (i.e., strong external difference families) in Z a 2 + 1 makes use of α‐valuations of complete bipartite graphs K a , a. We explore this approach and we provide a classification theorem which shows that all such α‐valuations can be constructed recursively via a sequence of “blow‐up ...
Donald L. Kreher +2 more
wiley +1 more source
Globally nilpotent differential operators and the square Ising model
, 2008 We recall various multiple integrals related to the isotropic square Ising model, and corresponding, respectively, to the n-particle contributions of the magnetic susceptibility, to the (lattice) form factors, to the two-point correlation functions and ...
Bostan, A. +5 more
core +3 more sources
Enumeration and Construction of Row‐Column Designs
Journal of Combinatorial Designs, Volume 33, Issue 9, Page 357-372, September 2025.ABSTRACT We computationally completely enumerate a number of types of row‐column designs up to isotopism, including double, sesqui, and triple arrays as known from the literature, and two newly introduced types that we call mono arrays and AO‐arrays. We calculate autotopism group sizes for the designs we generate.
Gerold Jäger +3 more
wiley +1 more source
The local $h$-vector of the cluster subdivision of a simplex [PDF]
, 2012 The cluster complex $\Delta (\Phi)$ is an abstract simplicial complex, introduced by Fomin and Zelevinsky for a finite root system $\Phi$. The positive part of $\Delta (\Phi)$ naturally defines a simplicial subdivision of the simplex on the vertex set of
Athanasiadis, Christos A. +1 more
core +2 more sources
Construction of Bernstein‐Based Words and Their Patterns
Mathematical Methods in the Applied Sciences, Volume 48, Issue 13, Page 12819-12836, September 2025.ABSTRACT In this paper, with inspiration of the definition of Bernstein basis functions and their recurrence relation, we give construction of a new word family that we refer Bernstein‐based words. By classifying these special words as the first and second kinds, we investigate their some fundamental properties involving periodicity and symmetricity ...
Irem Kucukoglu, Yilmaz Simsek
wiley +1 more source