Results 81 to 90 of about 159,494 (239)
On Quasi‐Hermitian Varieties in Even Characteristic and Related Orthogonal Arrays
Journal of Combinatorial Designs, Volume 33, Issue 3, Page 109-122, March 2025.ABSTRACT In this article, we study the BM quasi‐Hermitian varieties, laying in the three‐dimensional Desarguesian projective space of even order. After a brief investigation of their combinatorial properties, we first show that all of these varieties are projectively equivalent, exhibiting a behavior which is strikingly different from what happens in ...
Angela Aguglia +3 more
wiley +1 more source
Towards Nash‐Williams orientation conjecture for infinite graphs
Journal of Graph Theory, Volume 108, Issue 3, Page 608-619, March 2025.Abstract In 1960 Nash‐Williams proved that an edge‐connectivity of 2 k is sufficient for a finite graph to have a k
wiley +1 more source
A Review of Modern Multinomial‐Derived and Partition‐Based Record‐Linkage Methods
WIREs Computational Statistics, Volume 17, Issue 1, March 2025.ABSTRACT Fellegi and Sunter introduced in 1969 the first theory of record linkage. Their work was interpreted and applied in many situations. However, an infrastructure to support generalizing the theory was not available until 40 years later when Sadinle and Fienberg formally introduced partitioning in the record linkage arena.
Yves Thibaudeau
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
Journal of the London Mathematical Society, Volume 111, Issue 3, March 2025.Abstract We provide partial solutions to two problems posed by Shehtman concerning the modal logic of the Čech–Stone compactification of an ordinal space. We use the Continuum Hypothesis to give a finite axiomatization of the modal logic of β(ω2)$\beta (\omega ^2)$, thus resolving Shehtman's first problem for n=2$n=2$. We also characterize modal logics
Guram Bezhanishvili +3 more
wiley +1 more source
A Characterization of Bispecial Sturmian Words
, 2012 A finite Sturmian word w over the alphabet {a,b} is left special (resp. right special) if aw and bw (resp. wa and wb) are both Sturmian words. A bispecial Sturmian word is a Sturmian word that is both left and right special. We show as a main result that
A. Carpi +14 more
core +1 more source
Hurwitz numbers for reflection groups III: Uniform formulae
Journal of the London Mathematical Society, Volume 111, Issue 3, March 2025.Abstract We give uniform formulae for the number of full reflection factorizations of a parabolic quasi‐Coxeter element in a Weyl group or complex reflection group, generalizing the formula for the genus‐0 Hurwitz numbers. This paper is the culmination of a series of three.
Theo Douvropoulos +2 more
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
Enumerative combinatorics, representations and quasisymmetric functions
, 2022 Η παρούσα διατριβή αποτελείται ουσιαστικά από δυο μέρη με κύριο πρωταγωνιστή τις χρωματισμένες quasi-συμμετρικές συναρτήσεις. Το 1984 ο Gessel εισήγαγε τις quasi-συμμετρικές συναρτήσεις, μια γενίκευση των συμμετρικών συναρτήσεων. Έπειτα, το 1993, μαζί με τον Reutenauer μελέτησαν εκτιμήσεις διάφορων quasi-συμμετρικών συναρτήσεων που σχετίζονται με ...
openaire +2 more sources
Enumerative and planar combinatorics of trivariate monomial resolutions
, 2020 The canonical sylvan resolution is a resolution of an arbitrary monomial ideal over a polynomial ring that is minimal and has an explicit combinatorial formula for the differential. The differential is a weighted sum over lattice paths of weights of chain-link fences, which are sequences of faces that are linked to each other via higher-dimensional ...
openaire +2 more sources