Results 101 to 110 of about 98,708 (229)
Sequentially Constrained Hamilton Cycles in Random Graphs
ABSTRACT We discuss the existence of Hamilton cycles in the random graph Gn,p$$ {G}_{n,p} $$ where there are restrictions caused by (i) coloring sequences, (ii) a subset of vertices must occur in a specific order, and (iii) there is a bound on the number of inversions in the associated permutation.
Alan Frieze, Wesley Pegden
wiley +1 more source
Structure of Lower Tails in Sparse Random Graphs
ABSTRACT We study the typical structure of a sparse Erdős–Rényi random graph conditioned on the lower tail subgraph count event. We show that in certain regimes, a typical graph sampled from the conditional distribution resembles the entropy minimizer of the mean field approximation in the sense of both subgraph counts and cut norm.
Byron Chin
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol. 3 / 2018
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 110-160 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandache multi-spaces, Smarandache ...
openaire +1 more source
Abstract The back‐stripping technique is widely used in geological modeling to quantify basin subsidence history, sedimentation rates, and tectonic subsidence. Recent applications involve reconstructing paleo‐water depths, especially in oceanic and Arctic studies.
E. Vitagliano+3 more
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol. 4 / 2017
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 110-160 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandachemulti-spaces, Smarandache ...
openaire +1 more source
A topological algorithm for the Fourier transform of Stokes data at infinity
Abstract We give a topological description of the behaviour of Stokes matrices under the Fourier transform from infinity to infinity in a large number of cases of one level. This explicit, algorithmic statement is obtained by building on a recent result of T.
Jean Douçot, Andreas Hohl
wiley +1 more source
Birational complexity and dual complexes
Abstract We introduce the notion of birational complexity of a log Calabi–Yau pair. This invariant measures how far the log Calabi–Yau pair is from being birational to a toric pair. We study fundamental properties of the new invariant, with a particular focus on the geometry of dual complexes.
Mirko Mauri, Joaquín Moraga
wiley +1 more source
International Journal of Mathematical Combinatorics, Vol. 3 / 2017
The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 110-160 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandachemulti-spaces, Smarandache ...
openaire +1 more source
The Influence of Spatial Ability, Visual Thinking Ability, and Combinatorics Ability on Students Mathematical Problem Solving Ability [PDF]
Venina Sinaga+2 more
openalex +1 more source