Related papers: O(n) vector model at n=-1, -2 on random planar lat…

A relation between the average length of loops and their free energy is obtained for a variety of O(n)-type models on two-dimensional lattices, by extending to finite temperatures a calculation due to Kast. We show that the (number)…

We use variational minimizing methods to study spatial restricted N+1-body problems with a zero mass moving on the vertical axis of the moving plane for N equal masses. We prove that the minimizer of the Lagrangian action on the anti-T/2 or…

Linear lattice gauge theory is based on link variables that are arbitrary complex or real $N\times N$ matrices, in distinction to the usual (non-linear) formulation with unitary or orthogonal matrices. For a large region in parameter space…

Linear systems under the influence of nonlinear and random linear perturbations, and with random initial and boundary conditions, are discussed. The notion of states of a system is substituted by the notion of the generating vectors for…

The minimization of the action of a QFT with a constraint dictated by the block averaging procedure is an important part of Ba{\l}aban's approach to renormalization. It is particularly interesting for QFTs with non-trivial target spaces,…

Data-driven approaches have been proven effective in solving combinatorial optimization problems over graphs such as the traveling salesman problems and the vehicle routing problem. The rationale behind such methods is that the input…

We continue our study of the Johnson-Lindenstrauss lemma and its connection to circulant matrices started in \cite{HV}. We reduce the bound on $k$ from $k=O(\epsilon^{-2}\log^3n)$ proven there to $k=O(\epsilon^{-2}\log^2n)$. Our technique…

The study of spins and particles on graphs has broad applications, from the dynamics of interacting systems on networks to combinatorial problems. Here, we study the large-$n$ limit of the $O(n)$ model on graphs, which is considerably more…

Pattern matching is a fundamental process in almost every scientific domain. The problem involves finding the positions of a given pattern (usually of short length) in a reference stream of data (usually of large length). The matching can…

We propose a recursive lattice reduction framework for finding short non-zero vectors or dense sublattices of a lattice. The framework works by recursively searching for dense sublattices of dense sublattices (or their duals) with…

We present an iterative algorithm for solving a class of \\nonlinear Laplacian system of equations in $\tilde{O}(k^2m \log(kn/\epsilon))$ iterations, where $k$ is a measure of nonlinearity, $n$ is the number of variables, $m$ is the number…

We study a class of linearly coupled system of quasilinear equations. Under some assumptions on the nonlinear terms, we establish some results about the existence and regularity of vector solutions for the p-Laplacian systems by using…

We consider the O(n) theory in the $n \to 0$ limit. We show that the theory is described by logarithmic conformal field theory, and that the correlation functions have logarithmic singularities. The explicit forms of the two-, three- and…

We present an approximation scheme to solve the Non Perturbative Renormalization Group equations and obtain the full momentum dependence of the $n$-point functions. It is based on an iterative procedure where, in a first step, an initial…

The vector-balancing problem is a fundamental problem in discrepancy theory: given T vectors in $[-1,1]^n$, find a signing $\sigma(a) \in \{\pm 1\}$ of each vector $a$ to minimize the discrepancy $\| \sum_{a} \sigma(a) \cdot a \|_{\infty}$.…

Measurements and analysis of orbit response matrix have been providing for decades a formidable tool in the detection of linear lattice imperfections and their correction. Basically all storage-ring-based synchrotron light sources across…

Using Wegner-Houghton equation, within the Local Potential Approximation, we study critical properties of O(N) vector models. Fixed Points, together with their critical exponents and eigenoperators, are obtained for a large set of values of…

It is well-known that the finite-gap solutions of the KdV equation can be generated by its recursion operator.We generalize the result to a special form of Lax pair, from which a method to constrain the integrable system to a…

The solution of systems of non-autonomous linear ordinary differential equations is crucial in a variety of applications, such us nuclear magnetic resonance spectroscopy. A new method with spectral accuracy has been recently introduced in…

In the classically unbroken phase, 3d $O(N)$ symmetric $\phi^4$ vector models admit two equivalent descriptions connected by a strong-weak duality closely related to the one found by Chang and Magruder long ago. We determine the exact…