English
Related papers

Related papers: Extensive embeddings into Fra\"iss\'e structures a…

200 papers

One of the main challenges in the study of time-varying networks is the interplay of memory effects with structural heterogeneity. In particular, different nodes and dyads can have very different statistical properties in terms of both link…

Physics and Society · Physics 2026-04-20 Giulio Virginio Clemente , Claudio J. Tessone , Diego Garlaschelli

The existence of Steiner triple systems STS(n) of order n containing no nontrivial subsystem is well known for every admissible n. We generalize this result in two ways. First we define the expander property of 3-uniform hypergraphs and…

Combinatorics · Mathematics 2020-03-10 Zoltán L. Blázsik , Zoltán Lóránt Nagy

We devise a fairly general sufficient condition ensuring that the endomorphism monoid of a countably infinite ultrahomogeneous structure (i.e. a Fra\"{\i}ss\'{e} limit) embeds all countable semigroups. This approach provides us not only…

Group Theory · Mathematics 2014-03-10 Igor Dolinka , Dragan Mašulović

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…

Combinatorics · Mathematics 2025-01-16 Iian B. Smythe , Mithuna Threz , Max Wiebe

This is Part I of a two-part series regarding Ramsey properties of Fraisse structures satisfying a property called SDAP+, which strengthens the Disjoint Amalgamation Property. We prove that every Fraisse structure in a finite relational…

Combinatorics · Mathematics 2022-07-14 Rebecca Coulson , Natasha Dobrinen , Rehana Patel

For integer $k\geq2,$ a spanning $k$-ended-tree is a spanning tree with at most $k$ leaves. Motivated by the closure theorem of Broersma and Tuinstra [Independence trees and Hamilton cycles, J. Graph Theory 29 (1998) 227--237], we provide…

Combinatorics · Mathematics 2022-12-13 Guoyan Ao , Ruifang Liu , Jinjiang Yuan

We review a minimum set of notions from our previous paper on structural properties of SAT at arXiv:0802.1790 that will allow us to define and discuss the "complete internal independence" of a decision problem. This property is strictly…

Computational Complexity · Computer Science 2008-05-21 Silvano Di Zenzo

The signature is a canonical representation of a multidimensional path over an interval. However, it treats all historical information uniformly, offering no intrinsic mechanism for contextualising the relevance of the past. To address…

Machine Learning · Statistics 2026-03-20 Alexandre Bloch , Samuel N. Cohen , Terry Lyons , Joël Mouterde , Benjamin Walker

In the standard SIR model, infected vertices infect their neighbors at rate $\lambda$ independently across each edge. They also recover at rate $\gamma$. In this work we consider the SIR-$\omega$ model where the graph structure itself…

Probability · Mathematics 2025-05-16 Wenze Chen , Yuewen Hou , Dong Yao

Mixed (asymmetric) orthogonal arrays (MOAs) generalize classical orthogonal arrays by allowing columns over different alphabets. However, their study requires very different structural tools than those used for symmetric orthogonal arrays…

Information Theory · Computer Science 2026-03-20 Maryam Bajalan , Peter Boyvalenkov , Ferruh Özbudak

The spectral analysis of operators in heterogeneous and aging media typically requires a functional framework that extends beyond the standard Hilbertian setting. In this paper, we establish a rigorous distributional theory for a class of…

Functional Analysis · Mathematics 2026-01-30 Gustavo Dorrego

We study the aging properties, in particular the two-time autocorrelations, of the two-dimensional randomly diluted Ising ferromagnet below the critical temperature via Monte-Carlo simulations. We find that the autocorrelation function…

Disordered Systems and Neural Networks · Physics 2013-05-29 Raja Paul , Gregory Schehr , Heiko Rieger

Call a hereditary family $\mathcal{F}$ of graphs strongly persistent if there exists a graphon $W$ such that in all subgraphons $W'$ of $W$, $\mathcal{F}$ is precisely the class of finite graphs that have positive density in $W'$. Our first…

Combinatorics · Mathematics 2024-07-22 Leonardo N. Coregliano , Maryanthe Malliaris

The individual building blocks of van der Waals (vdW) heterostructures host fascinating physical phenomena, ranging from ballistic electron transport in graphene to striking optical properties of MoSe2 sheets. The presence of bonded and…

Disordered Systems and Neural Networks · Physics 2016-06-14 Nouamane Laanait , Zhan Zhang , Christian M. Schleputz , Ying Liu , Michael Wojcik , Rachael L. Myers-Ward , D. Kurt Gaskill , Paul Fenter , Lian Li

We explore the behavior of spatially heterogeneous elastic moduli as well as the correlations between local moduli in model solids with short-range repulsive potentials. We show through numerical simulations that local elastic moduli…

Soft Condensed Matter · Physics 2025-07-15 Surajit Chakraborty , Kabir Ramola

Self-shaping of curved structures, especially those involving flexible thin layers, has attracted increasing attention because of their broad potential applications in e.g. nanoelectromechanical/micro-electromechanical systems (NEMS/MEMS),…

Soft Condensed Matter · Physics 2015-12-17 Zi Chen , Gaoshan Huang , Ian Trase , Xiaomin Han , Yongfeng Mei

We investigate infinite-exponent partition relations on arbitrary relational structures, with a focus on linear orders and graphs. Any such relation contradicts the Axiom of Choice. We show that there are some such relations which are…

Logic · Mathematics 2026-05-22 Lyra A. Gardiner , Jonathan Schilhan

In this work, we consider an extension of graphical models to random graphs, trees, and other objects. To do this, many fundamental concepts for multivariate random variables (e.g., marginal variables, Gibbs distribution, Markov properties)…

Machine Learning · Statistics 2017-05-08 Neil Hallonquist

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

Dynamical Systems · Mathematics 2025-09-10 Robert Bland , Kevin McGoff

Finite order invariants (Vassiliev invariants) of knots are expressed in terms of weight systems, that is, functions on chord diagrams satisfying the four-term relations. Weight systems have graph analogues, so-called $4$-invariants of…

Combinatorics · Mathematics 2018-06-01 V. I. Zhukov