Results 121 to 130 of about 3,063 (228)

Real models for the framed little n$n$‐disks operads

Journal of Topology, Volume 18, Issue 4, December 2025.
Abstract We study the action of the orthogonal group on the little n$n$‐disks operads. As an application we provide small models (over the reals) for the framed little n$n$‐disks operads. It follows in particular that the framed little n$n$‐disks operads are formal (over the reals) for n$n$ even and coformal for all n$n$.
Anton Khoroshkin, Thomas Willwacher
wiley   +1 more source

Dual spaces of geodesic currents

Journal of Topology, Volume 18, Issue 4, December 2025.
Abstract Every geodesic current on a hyperbolic surface has an associated dual space. If the current is a lamination, this dual embeds isometrically into a real tree. We show that, in general, the dual space is a Gromov hyperbolic metric tree‐graded space, and express its Gromov hyperbolicity constant in terms of the geodesic current.
Luca De Rosa, Dídac Martínez‐Granado
wiley   +1 more source

A bijection which implies Melzer's polynomial identities: the? 1,1 (p,p+1) case [PDF]

, 1996
Omar Foda, S. Ole Warnaar
openalex   +1 more source

Chordal Graphs, Even‐Hole‐Free Graphs and Sparse Obstructions to Bounded Treewidth

Journal of Graph Theory, Volume 110, Issue 3, Page 351-365, November 2025.
ABSTRACT Even‐hole‐free graphs pose a central challenge in identifying hereditary classes of bounded treewidth. We investigate this matter by presenting and studying the following conjecture: for an integer t ≥ 4 and a graph H, every even‐hole‐free graph of large enough treewidth has an induced subgraph isomorphic to either K t or H, if (and only if) H
Sepehr Hajebi
wiley   +1 more source

A sparse latent class model incorporating response times

British Journal of Mathematical and Statistical Psychology, Volume 78, Issue 3, Page 757-784, November 2025.
Abstract Diagnostic models (DM) have been widely used to classify respondents' latent attributes in cognitive and non‐cognitive assessments. The integration of response times (RTs) with DM presents additional evidence to understand respondents' problem‐solving behaviours.
Siqi He, Steven Andrew Culpepper, Jeffrey A. Douglas   +2 more
wiley   +1 more source

Boundary conditions and universal finite‐size scaling for the hierarchical |φ|4$|\varphi |^4$ model in dimensions 4 and higher

Communications on Pure and Applied Mathematics, Volume 78, Issue 10, Page 2001-2118, October 2025.
Abstract We analyse and clarify the finite‐size scaling of the weakly‐coupled hierarchical n$n$‐component |φ|4$|\varphi |^4$ model for all integers n≥1$n \ge 1$ in all dimensions d≥4$d\ge 4$, for both free and periodic boundary conditions. For d>4$d>4$, we prove that for a volume of size Rd$R^{d}$ with periodic boundary conditions the infinite‐volume ...
Emmanuel Michta, Jiwoon Park, Gordon Slade   +2 more
wiley   +1 more source

Unusual and bijectively related manifolds

Applied General Topology, 2003
<p>A manifold is “unusual” if it admits of a continuous self-bijection which is not a homeomorphism. The present paper is a survey of work published over yearsaugmented with recent examples and results.</p>
openaire   +6 more sources

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

On Endomorphism Universality of Sparse Graph Classes

Journal of Graph Theory, Volume 110, Issue 2, Page 223-244, October 2025.
ABSTRACT We show that every commutative idempotent monoid (a.k.a. lattice) is the endomorphism monoid of a subcubic graph. This solves a problem of Babai and Pultr and the degree bound is best‐possible. On the other hand, we show that no class excluding a minor can have all commutative idempotent monoids among its endomorphism monoids. As a by‐product,
Kolja Knauer, Gil Puig i Surroca
wiley   +1 more source

Precedence‐Constrained Shortest Path

Networks, Volume 86, Issue 3, Page 282-295, October 2025.
ABSTRACT We propose a variant of the shortest path problem where the order in which vertices occur in the path is subject to precedence constraints. Precedence constraints are defined in terms of vertex pairs (a,b)$$ \left(a,b\right) $$ which indicate that a vertex a$$ a $$ is the predecessor of a vertex b$$ b $$.
Christina Büsing, Dennis John, Corinna Mathwieser   +2 more
wiley   +1 more source