Vortex filament equation for a regular polygon

In this paper, we study the evolution of the vortex filament equation,$$X_t = X_s \wedge X_{ss},$$with $X(s, 0)$ being a regular planar polygon. Using algebraic techniques, supported by full numerical simulations, we give strong evidence that $X(s, t)$ is also a polygon at any rational time; moreover, it can be fully characterized, up to a rigid movement, by a generalized quadratic Gau$\beta$ sum. We also study the fractal behaviour of $X(0, t)$, relating it with the so-called Riemann's non-differentiable function, that was proved by Jaffard to be a multifractal

On the Relationship between the One-Corner Problem and the M−M-Corner Problem for the Vortex Filament Equation

In this paper, we give evidence that the evolution of the vortex filament equation (VFE) for a regular M-corner polygon as initial datum can be explained at infinitesimal times as the superposition of M one-corner initial data. This fact is mainly sustained with the calculation of the speed of the center of mass; in particular, we show that several conjectures made at the numerical level are in agreement with the theoretical expectations. Moreover, due to the spatial periodicity, the evolution of VFE at later times can be understood as the nonlinear interaction of infinitely many filaments, one for each corner; and this interaction turns out to be some kind of nonlinear Talbot effect. We also give very strong numerical evidence of the transfer of energy and linear momentum for the M-corner case; and the numerical experiments carried out provide new arguments that support the multifractal character of the trajectory defined by one of the corners of the initial polygon

The Vortex Filament Equation as a Pseudorandom Generator

In this paper, we consider the evolution of the so-called vortex filament equation (VFE), $$X_t = X_s \wedge X_{ss},$$ taking a planar regular polygon of M sides as initial datum. We study VFE from a completely novel point of view: that of an evolution equation which yields a very good generator of pseudorandom numbers in a completely natural way. This essential randomness of VFE is in agreement with the randomness of the physical phenomena upon which it is based

Vortex Filament Equation for a regular polygon in the hyperbolic plane

The aim of this article is twofold. First, we show the evolution of the vortex filament equation (VFE) for a regular planar polygon in the hyperbolic space. Unlike in the Euclidean space, the planar polygon is open and both of its ends grow exponentially, which makes the problem more challenging from a numerical point of view. However, with fixed boundary conditions, a finite difference scheme and a fourth-order Runge--Kutta method in time, we show that the numerical solution is in complete agreement with the one obtained from algebraic techniques. Second, as in the Euclidean case, we claim that, at infinitesimal times, the evolution of VFE for a planar polygon as the initial datum can be described as a superposition of several one-corner initial data. As a consequence, not only can we compute the speed of the center of mass of the planar polygon, but the relationship also allows us to compare the time evolution of any of its corners with that in the Euclidean case

On the Evolution of the Vortex Filament Equation for regular M-polygons with nonzero torsion

In this paper, we consider the evolution of the Vortex Filament equa- tion (VFE): Xt = Xs ∧ Xss, taking M-sided regular polygons with nonzero torsion as initial data. Us- ing algebraic techniques, backed by numerical simulations, we show that the solutions are polygons at rational times, as in the zero-torsion case. However, unlike in that case, the evolution is not periodic in time; more- over, the multifractal trajectory of the point X(0,t) is not planar, and appears to be a helix for large times. These new solutions of VFE can be used to illustrate numerically that the smooth solutions of VFE given by helices and straight lines share the same instability as the one already established for circles. This is accomplished by showing the existence of variants of the so-called Rie- mann’s non-differentiable function that are as close to smooth curves as desired, when measured in the right topology. This topology is motivated by some recent results on the well-posedness of VFE, which prove that the selfsimilar solutions of VFE have finite renormalized energy

Hardness of Graph Pricing through Generalized Max-Dicut

The Graph Pricing problem is among the fundamental problems whose approximability is not well-understood. While there is a simple combinatorial 1/4-approximation algorithm, the best hardness result remains at 1/2 assuming the Unique Games Conjecture (UGC). We show that it is NP-hard to approximate within a factor better than 1/4 under the UGC, so that the simple combinatorial algorithm might be the best possible. We also prove that for any $\epsilon > 0$, there exists $\delta > 0$ such that the integrality gap of $n^{\delta}$-rounds of the Sherali-Adams hierarchy of linear programming for Graph Pricing is at most 1/2 + $\epsilon$. This work is based on the effort to view the Graph Pricing problem as a Constraint Satisfaction Problem (CSP) simpler than the standard and complicated formulation. We propose the problem called Generalized Max-Dicut($T$), which has a domain size $T + 1$ for every $T \geq 1$. Generalized Max-Dicut(1) is well-known Max-Dicut. There is an approximation-preserving reduction from Generalized Max-Dicut on directed acyclic graphs (DAGs) to Graph Pricing, and both our results are achieved through this reduction. Besides its connection to Graph Pricing, the hardness of Generalized Max-Dicut is interesting in its own right since in most arity two CSPs studied in the literature, SDP-based algorithms perform better than LP-based or combinatorial algorithms --- for this arity two CSP, a simple combinatorial algorithm does the best.Comment: 28 page