Related papers: Fractal and Statistical Properties of Large Compac…
We show the existence of regular combinatorial objects which previously were not known to exist. Specifically, for a wide range of the underlying parameters, we show the existence of non-trivial orthogonal arrays, t-designs, and t-wise…
To seek for a possible origin of fractal pattern in nature, we perform a molecular dynamics simulation for a fragmentation of an infinite fcc lattice. The fragmentation is induced by the initial condition of the model that the lattice…
We investigate interfacial properties between two highly incompatible polymers of different stiffness. The extensive Monte Carlo simulations of the binary polymer melt yield detailed interfacial profiles and the interfacial tension via an…
We introduce positive elastic potentials in the harmonic approximation leading by Hamilton's variational principle to fractional Laplacian matrices having the forms of power law matrix functions of the simple local Bornvon Karman Laplacian.…
Bridging algorithms are global Monte Carlo moves which allow for an efficient sampling of single polymer chains. In this manuscript we discuss the adaptation of three bridging algorithms from lattice to continuum models, and give details on…
We calculate perturbative Wilson loops of various sizes up to loop order $n=20$ at different lattice sizes for pure plaquette and tree-level improved Symanzik gauge theories using the technique of Numerical Stochastic Perturbation Theory.…
We present a Bethe approximation to study lattice models of linear polymers. The approach is variational in nature and based on the cluster variation method (CVM). We focus on a model with $(i)$ a nearest neighbor attractive energy…
Based on the standard many-fermion field theory, the authors construct models describing ultracold fermions in a 1D optical lattices by implementing a mode expansion of the fermionic field operator where modes, in addition to space…
We present here the systematic development of quantitative lattice simulations of dense polymers through a novel computational technique that allows for an efficient accounting of the chain conformations. Our approach is based on the…
We establish a connection between exclusion statistics with arbitrary integer exclusion parameter $g$ and a class of random walks on planar lattices. This connection maps the generating function for the number of closed walks of given…
We prove the fractal crumpled structure of collapsed unknotted polymer ring. In this state the polymer chain forms a system of densely packed folds, mutually separated in all scales. The proof is based on the numerical and analytical…
Lattice models are valuable tools to gain insight into the statistical physics of heteropolymers. We rigorously map the partition function of these models into a vacuum expectation value of a $\mathbb{Z}_2$ lattice gauge theory (LGT), with…
The conformational states of a semiflexible polymer enclosed in a compact domain of typical size $a$ are studied as stochastic realizations of paths defined by the Frenet equations under the assumption that stochastic "curvature" satisfies…
From the integer quantum Hall effect, to swimming at low Reynolds number, geometric phases arise in the description of many different physical systems. In many of these systems the temporal evolution prescribed by the geometric phase can be…
The scaling behaviour of randomly branched polymers in a good solvent is studied in two to nine dimensions, using as microscopic models lattice animals and lattice trees on simple hypercubic lattices. As a stochastic sampling method we use…
In many condensed-matter systems, it is very useful to introduce a quasi-particle approach, which is based on some sort of linearization around a suitable background state. In order to be a systematic and controlled approximation, this…
Assuming Gaussian chain statistics along the chain contour, we generate by means of a proper fractal generator hyperbranched polymer trees which are marginally compact. Static and dynamical properties, such as the radial intrachain pair…
A fractal method to detect, locate and quantify chaos in multi-dimensional-conservative-closed systems, based on the creation of artificial exits, is presented. The method is invariant under space-time changes of coordinates and can be used…
Many hard graph problems, such as Hamiltonian Cycle, become FPT when parameterized by treewidth, a parameter that is bounded only on sparse graphs. When parameterized by the more general parameter clique-width, Hamiltonian Cycle becomes…
We consider a model of two (fully) compact polymer chains, coupled through an attractive interaction. These compact chains are represented by Hamiltonian paths (HP), and the coupling favors the existence of common bonds between the chains.…