English
Related papers

Related papers: The largest fragment of a homogeneous fragmentatio…

200 papers

We consider the fragmentation process with mass loss and discuss self-similar properties of the arising structure both in time and space focusing on dimensional analysis. This exhibits a spectrum of mass exponents $\theta$, whose exact…

Statistical Mechanics · Physics 2016-08-31 M. K. Hassan

We show a new method for analyzing the time evolution of the Schrodinger wave function phi(x,t). We propose the decomposition of the Hamiltonian as: H(t)=Hp(t)+Hc(t), where Hp(t)is the operator which does not change the state and therefore…

Quantum Physics · Physics 2014-08-08 Chyi-Lung Lin , Tsin-Fu Jiang

We consider a one-dimensional diffusion process with coefficients that are periodic outside of a finite 'interface region'. The question investigated in this article is the limiting long time / large scale behaviour of such a process under…

Probability · Mathematics 2010-05-14 Martin Hairer , Charles Manson

We consider the totally asymmetric simple exclusion process on a ring with flat and step initial conditions. We assume that the size of the ring and the number of particles tend to infinity proportionally and evaluate the fluctuations of…

Mathematical Physics · Physics 2017-03-02 Jinho Baik , Zhipeng Liu

For each nonempty integer partition $\pi$, we define the maximal excludant of $\pi$ to be the largest nonnegative integer smaller than the largest part of $\pi$ that is not a part of $\pi$. Let $\sigma\!\operatorname{maex}(n)$ be the sum of…

Combinatorics · Mathematics 2019-05-16 Shane Chern

A novel powerful mathematical method is presented, which allows us to find an analytical solution of a simplified version of the statistical multifragmentation model with the restriction that the largest fragment size cannot exceed the…

Nuclear Theory · Physics 2007-05-23 Kyrill A. Bugaev

We study the problem of partitioning the edges of a $d$-uniform hypergraph $H$ into a family $F$ of complete $d$-partite hypergraphs ($d$-cliques). We show that there is a partition $F$ in which every vertex $v \in V(H)$ belongs to at most…

In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a base-compressor C gets a compressed output that is shorter than applying C over the entire T at once.…

Data Structures and Algorithms · Computer Science 2009-06-26 Paolo Ferragina , Igor Nitto , Rossano Venturini

The Karmarkar-Karp differencing algorithm is the best known polynomial time heuristic for the number partitioning problem, fundamental in both theoretical computer science and statistical physics. We analyze the performance of the…

Numerical Analysis · Computer Science 2008-10-03 Stefan Boettcher , Stephan Mertens

We study the periodic dynamics of a spin-one chain driven using a square-pulse protocol with amplitude $Q_0$ and frequency $\omega_D$. The Hamiltonian of the spin chain hosts a thermodynamically large number of $Z_2$-valued conserved…

Statistical Mechanics · Physics 2026-03-09 Krishanu Ghosh , Diptiman Sen , K. Sengupta

Finding locally optimal solutions for max-cut and max-$k$-cut are well-known PLS-complete problems. An instinctive approach to finding such a locally optimum solution is the FLIP method. Even though FLIP requires exponential time in…

Data Structures and Algorithms · Computer Science 2018-07-17 Ali Bibak , Charles Carlson , Karthekeyan Chandrasekaran

A subset of vertices $F$ in a graph $G$ is called a \emph{dissociation set} if the induced subgraph $G[F]$ of $G$ has maximum degree at most 1. A \emph{maximal dissociation set} of $G$ is a dissociation set which is not a proper subset of…

Combinatorics · Mathematics 2021-03-03 Jianhua Tu , Yuxin Li , Junfeng Du

Theories suggest that filament fragmentation should occur on a characteristic fragmentation length-scale. This fragmentation length-scale can be related to filament properties, such as the width and the dynamical state of the filament. Here…

Astrophysics of Galaxies · Physics 2019-01-30 S. D. Clarke , G. M. Williams , J. C. Ibáñez-Mejía , S. Walch

A classical theorem of Roth states that the maximum size of a solution-free set of a homogeneous linear equation $\mathcal{L}$ in $\mathbb{F}_p$ is $o(p)$ if and only if the sum of the coefficients of $\mathcal{L}$ is $0$. In this paper, we…

Combinatorics · Mathematics 2025-07-31 Matija Bucić , Micha Christoph , Jaehoon Kim , Hyunwoo Lee , Varun Sivashankar

We consider Hamiltonian diffeomorphisms $\phi$ of the unit cotangent bundle over a closed Riemannian manifold $(M,g)$ which extend to Hamiltonian diffeomorphisms of $T^*M$ equal to the time-1-map of the geodesic flow for $|p| \ge 1$. For…

Symplectic Geometry · Mathematics 2007-05-23 Urs Frauenfelder , Felix Schlenk

This paper is about the homogenization of linear elliptic operators in divergence form with stationary random coefficients that have only slowly decaying correlations. It deduces optimal estimates of the homogenization error from optimal…

Analysis of PDEs · Mathematics 2022-02-09 Antoine Gloria , Stefan Neukamm , Felix Otto

We carry out a resolution study on the fragmentation boundary of self-gravitating discs. We perform three-dimensional Smoothed Particle Hydrodynamics simulations of discs to determine whether the critical value of the cooling timescale in…

Earth and Planetary Astrophysics · Physics 2015-05-20 Farzana Meru , Matthew R. Bate

The time-dependent Gross-Pitaevksii equation (GPE) is a nonlinear Schr\"odinger equation which is used in quantum physics to model the dynamics of Bose-Einstein condensates. In this work we consider numerical approximations of the GPE based…

Numerical Analysis · Mathematics 2024-09-19 Christian Döding

Finite-size scaling expressions for the current near the continuous phase transition, and for the local density near the first-order transition, are found in the steady state of the one-dimensional fully asymmetric simple-exclusion process…

Cellular Automata and Lattice Gases · Physics 2009-11-07 Jordan G. Brankov

The separation dimension of a graph $G$, written $\pi(G)$, is the minimum number of linear orderings of $V(G)$ such that every two nonincident edges are "separated" in some ordering, meaning that both endpoints of one edge appear before…

Combinatorics · Mathematics 2016-09-07 Sarah J. Loeb , Douglas B. West