Results 71 to 80 of about 162,256 (241)

On the sub-permutations of pattern avoiding permutations

, 2014
There is a deep connection between permutations and trees. Certain sub-structures of permutations, called sub-permutations, bijectively map to sub-trees of binary increasing trees.
Disanto, Filippo, Wiehe, Thomas
core   +1 more source

Indiscernibles in monadically NIP theories

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3326-3345, November 2025.
Abstract We prove various results around indiscernibles in monadically NIP theories. First, we provide several characterizations of monadic NIP in terms of indiscernibles, mirroring previous characterizations in terms of the behavior of finite satisfiability. Second, we study (monadic) distality in hereditary classes and complete theories.
Samuel Braunfeld, Michael C. Laskowski
wiley   +1 more source

Estimates on the decay of the Laplace–Pólya integral

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3360-3379, November 2025.
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

Enumerating Stable Nanopores in Graphene and their Geometrical Properties Using the Combinatorics of Hexagonal Lattices [PDF]

, 2022
Sneha Thomas, Kevin S. Silmore, Ananth Govind Rajan   +2 more
openalex   +1 more source

Centrality of star and monotone factorisations

Bulletin of the London Mathematical Society, Volume 57, Issue 11, Page 3567-3585, November 2025.
Abstract A factorisation problem in the symmetric group is central if conjugate permutations always have the same number of factorisations. We give the first fully combinatorial proof of the centrality of transitive star factorisations that is valid in all genera, which answers a natural question of Goulden and Jackson from 2009.
Jesse Campion Loth, Amarpreet Rattan
wiley   +1 more source

Thom series of contact singularities [PDF]

, 2010
Thom polynomials measure how global topology forces singularities. The power of Thom polynomials predestine them to be a useful tool not only in differential topology, but also in algebraic geometry (enumerative geometry, moduli spaces) and algebraic ...
Fehér, L. M., Rimányi, R.
core  

Enumeration of E ( s 2 )‐Optimal and Minimax‐Optimal Supersaturated Designs With 12 Rows, 11 q Columns and s max = 4

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

Abundant Neighborhoods, Two‐Sided Markets, and Maximal Matchings

Naval Research Logistics (NRL), Volume 72, Issue 7, Page 1022-1035, October 2025.
ABSTRACT I introduce a new graph‐theoretic property called abundant neighborhoods. This property is motivated by studying the thickness of economic markets. A vertex is, roughly, guaranteed to match if and only if it has an abundant neighborhood.
Muhammad Maaz
wiley   +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, Maura B. Paterson, Douglas R. Stinson   +2 more
wiley   +1 more source