SearcharxivSearch

arXiv subjects

Valerii Sopin

Publications and source records attributed to Valerii Sopin.

10 recordsLinked to original sources

Using Erdős's methods to study Yorke's problems

In this paper, we study the possible bifurcations of periodic orbits by analyzing them as graphs. In detail, we construct a collection of graphs which are an idealized versions of bifurcation diagrams and color them using the Mallet-Yorke Orbit Index (and the Lefschetz Fixed Point Theorem). The aforementioned allows to study the genericity of routes to chaos, as well as to gain insight into their possible complexity. In particular, our results can be interpreted as saying that there is no upper bound on the possible complexity of routes to chaos in high dimensional systems.

math.DS

When Entropy flows: drifting along the route to Chaos

Consider a smooth one-parameter family of vector fields defined over some smooth manifold transitions from order into chaos. Inspired by the Second law of Thermodynamics, one is led to ask: can we find a flow whose dynamics realize this transition? To answer this question, motivated by the Mallet-Yorke Orbit Index theory, the Arnold-Khesin scheme for hydrodynamics and a heuristic argument by Rene Thom, we introduce a construction that transforms any one-parameter family of vector fields into a new object: the "Entropy flow". The Entropy flow is a flow defined on the product of the phase space with the parameter space and is best thought of as a flow generated by the original one-parameter family together with a drift in the parameter space, that pushes the trajectory of a given initial condition into a disordered, more complex state. To exemplify, for the Period Doubling, the Ruelle-Takens-Newhouse and the Intermittency routes to chaos the Entropy flow behaves exactly as expected - that is, it truly pushes trajectories into more complex states. In addition, in the spirit of Forcing Theory, in the paper we use the Conley index to discuss how one can use the Entropy flow to study the connection between topology and bifurcations. Moreover, drawing on the numerical and analytic evidence, we will analyze how the Entropy flow behaves in several examples of famous flows, including the Lorenz system, the Rössler attractor, and the breakup of the Shilnikov homoclinic scenario.

math.DS

A Tensor Category Construction of the $W_{p,q}$ Triplet Vertex Operator Algebra and Applications

For coprime $p,q\in\mathbb{Z}_{\geq 2}$, the triplet vertex operator algebra $W_{p,q}$ is a non-simple extension of the universal Virasoro vertex operator algebra of central charge $c_{p,q}=1-\frac{6(p-q)^2}{pq}$, and it is a basic example of a vertex operator algebra appearing in logarithmic conformal field theory. Here, we give a new construction of $W_{p,q}$ different from the original screening operator definition of Feigin-Gainutdinov-Semikhatov-Tipunin. Using our earlier work on the tensor category structure of modules for the Virasoro algebra at central charge $c_{p,q}$, we show that the simple modules appearing in the decomposition of $W_{p,q}$ as a module for the Virasoro algebra have $\mathrm{PSL}_2$-fusion rules and generate a symmetric tensor category equivalent to $\operatorname{Rep}\mathrm{PSL}_2$. Then we use the theory of commutative algebras in braided tensor categories to construct $W_{p,q}$ as an appropriate non-simple modification of the canonical algebra in the Deligne tensor product of $\operatorname{Rep}\mathrm{PSL}_2$ with this Virasoro subcategory. As a consequence, we show that the automorphism group of $W_{p,q}$ is $\mathrm{PSL}_2(\mathbb{C})$. We also define a braided tensor category $\mathcal{O}_{c_{p,q}}^0$ consisting of modules for the Virasoro algebra at central charge $c_{p,q}$ that induce to untwisted modules of $W_{p,q}$. We show that $\mathcal{O}_{c_{p,q}}^0$ tensor embeds into the $\mathrm{PSL}_2(\mathbb{C})$-equivariantization of the category of $W_{p,q}$-modules and is closed under contragredient modules. We conjecture that $\mathcal{O}_{c_{p,q}}^0$ has enough projective objects and is the correct category of Virasoro modules for constructing logarithmic minimal models in conformal field theory.

math.QA

Period-Doubling Cascades Invariants: Braided Routes To Chaos

By a classical result of Kathleen Alligood and James Yorke we know that as we isotopically deform a map $f:ABCD\to\mathbb{R}^2$ to a Smale horseshoe map we should often expect the dynamical complexity to increase via a period--doubling route to chaos. Inspired by this fact and by how braids force the existence of complex dynamics, in this paper we introduce three topological invariants that describe the topology of period--doubling routes to chaos. As an application, we use our methods to ascribe symbolic dynamics to perturbations of the Shilnikov homoclinic scenario and to study the dynamics of the Henon map.

math.DS

Fusion and (non)-rigidity of Virasoro Kac modules in logarithmic minimal models at $(p,q)$-central charge

Let $\mathcal{O}_c$ be the category of finite-length modules for the Virasoro Lie algebra at central charge $c$ whose composition factors are irreducible quotients of reducible Verma modules. For any $c\in\mathbb{C}$, this category admits the vertex algebraic braided tensor category structure of Huang, Lepowsky, and Zhang. Here, we begin the detailed study of $\mathcal{O}_{c_{p,q}}$ where $c_{p,q} = 1-\frac{6(p-q)^2}{pq}$ for relatively prime integers $p, q \geq 2$; in conformal field theory, $\mathcal{O}_{c_{p,q}}$ corresponds to a logarithmic extension of the central charge $c_{p,q}$ Virasoro minimal model. We particularly focus on the Virasoro Kac modules $\mathcal{K}_{r,s}$, $r,s\in\mathbb{Z}_{\geq 1}$, in $\mathcal{O}_{c_{p,q}}$ defined by Morin-Duchesne, Rasmussen, and Ridout, which are finitely-generated submodules of Feigin-Fuchs modules for the Virasoro algebra. We prove that $\mathcal{K}_{r,s}$ is rigid and self-dual when $1\leq r\leq p$ and $1\leq s\leq q$, but that not all $\mathcal{K}_{r,s}$ are rigid when $r>p$ or $s>q$. That is, $\mathcal{O}_{c_{p,q}}$ is not a rigid tensor category. We also show that all Kac modules and all simple modules in $\mathcal{O}_{c_{p,q}}$ are homomorphic images of repeated tensor products of $\mathcal{K}_{1,2}$ and $\mathcal{K}_{2,1}$, and we determine completely how $\mathcal{K}_{1,2}$ and $\mathcal{K}_{2,1}$ tensor with Kac modules and simple modules in $\mathcal{O}_{c_{p,q}}$. In the process, we prove some fusion rule conjectures of Morin-Duchesne, Rasmussen, and Ridout.

math.QA

PH = PSPACE

In this paper we show that PSPACE is equal to 4th level in the polynomial hierarchy. We also deduce a lot of important consequences. True quantified Boolean formula is a generalisation of the Boolean Satisfiability Problem, where determining of interpretation that satisfies a given Boolean formula is replaced by existence of Boolean functions that makes a given QBF to be tautology. Such functions are called the Skolem functions. The essential idea of the proof is to show that for any quantified Boolean formula $ϕ$ we can obtain a formula $ϕ'$ which is in the 4th level of the polynomial hierarchy, no more than polynomial in the size of a given $ϕ$, such that the truth of $ϕ$ can be determined from the truth of $ϕ'$. The idea is to skolemize, and then use additional formulas from the 2nd level of the polynomial hierarchy inside the skolemized prefix to enforce that the skolem variables indeed depend only on the universally quantified variables they are supposed to. However, some dependence is lost when the quantification is reversed. It is called "XOR issue" because the functional dependence can be expressed by means of an XOR formula. Thus, it is needed to locate these XORs, but there is no need to locate all chains with XORs: any chain includes a XOR of only two variables. The last can be done locally in each iteration (keep in mind the algebraic normal form (ANF)), when all arguments are specified, i.e. as a polynomial subroutine. Relativization is defeated due to the well-known fact: PH = PSPACE iff second-order logic over finite structures gains no additional power from the addition of a transitive closure operator. The exchange is possible due to finite possibilities for arguments. So, the theorems with oracles are not applicable since a random oracle is an arbitrary set. And that's why PH is infinite relative to a random oracle with probability 1.

cs.CC

Quantum Lichnerowicz - Poisson complex

Using the curved bc-beta-gamma system (a tensor product of a Heisenberg and a Clifford vertex algebra) we introduce quantum analogy of Lichnerowicz differential. As follows we suggest new machinery for finding the Lichnerowicz-Poisson cohomology groups for any Poisson manifold. Moreover, the defined provides new invariant. Keywords: Poisson manifold, Lichnerowicz differential, Chiral de Rham complex, cohomologies, vertex algebras, deformation theory, Nambu-Poisson bracket, n-Lie algebras, Gromov-Witten theory.

math.QA

Ergodic dynamical systems over the Cartesian power of the ring of p-adic integers

For any 1-lipschitz ergodic map $F:\; \mathbb{Z}^{k}_{p} \mapsto \mathbb{Z}^{k}_{p},\;k>1\in\mathbb{N},$ there are 1-lipschitz ergodic map $G:\; \mathbb{Z}_{p} \mapsto \mathbb{Z}_{p}$ and two bijection $H_k$, $T_{k,\;P}$ that $$G = H_{k} \circ T_{k,\;P}\circ F\circ H^{-1}_{k} \text{ and } F = H^{-1}_{k} \circ T_{k,\;P^{-1}}\circ G\circ H_{k}.$$

math.DS

Construction of an algebra corresponding to a statistical model of the square ladder (square lattice with two lines)

In this paper we define infinite-dimensional algebra and its representation, whose basis is naturally identified with semi-infinite configurations of the square ladder model. We also extrapolate the ideas for the cyclic 3-leg triangular ladder model. All of these propose a way for generalization, which leads to representations of N = 2, ... algebras. Keywords: 2D lattice, square ladder, triangular ladder, conformal algebra, semi-infinite forms, fermions, quadratic algebra, superfrustration, graded Euler characteristic, cohomology, deformation, Jacobi triple product, superalgebras, operator algebras, N = 2, ... algebras.

math.CO

A new algorithm for solving the rSUM problem

A determined algorithm is presented for solving the rSUM problem for any natural r with a sub-quadratic assessment of time complexity in some cases. In terms of an amount of memory used the obtained algorithm is the nlog^3(n) order. The idea of the obtained algorithm is based not considering integer numbers, but rather k (is a natural) successive bits of these numbers in the binary numeration system. It is shown that if a sum of integer numbers is equal to zero, then the sum of numbers presented by any k successive bits of these numbers must be sufficiently "close" to zero. This makes it possible to discard the numbers, which a fortiori, do not establish the solution.

cs.DS