English
Related papers

Related papers: Topological Complexity of wedges

200 papers

Let X/G be a 3-dimensional Calabi-Yau orbifold with codimension 2 singularities. The topology of crepant resolutions of X/G is described by the McKay correspondence (Reid, Ito). We study Calabi-Yau 3-folds Y that arise by deforming the…

Algebraic Geometry · Mathematics 2007-05-23 Dominic Joyce

The cross topology $\gamma$ on a product of topological spaces $X$ and $Y$ is the collection of all sets $G\subseteq X\times Y$ such that the intersection of $G$ with every vertical line and every horizontal line is an open subset of either…

General Topology · Mathematics 2016-01-25 Olena Karlova , Volodymyr Mykhaylyuk

We give a simple description of the topology of free topological vector space $\mathbb{V}(X)$ and the topology of the free locally convex space $L(X)$ over a Tychonoff space $X$. The case when $X$ is a pseudocompact space is also…

General Topology · Mathematics 2025-05-13 Saak Gabriyelyan

We propose a new version of Wigner-Weyl calculus for tight-binding lattice models. It allows to express various physical quantities through Weyl symbols of operators and Green's functions. In particular, Hall conductivity in the presence of…

Mathematical Physics · Physics 2020-04-22 I. V. Fialkovsky , M. A. Zubkov

We determine the topological complexity of unordered configuration spaces on almost all punctured surfaces (both orientable and non-orientable). We also give improved bounds for the topological complexity of unordered configuration spaces…

Algebraic Topology · Mathematics 2019-05-29 Andrea Bianchi , David Recio-Mitter

We prove the equality $\dTC(\Gamma)=\TC(\Gamma)$ for distributional topological complexity of torsion free hyperbolic and of torsion free nilpotent groups. For the distributional topological complexity of lens spaces we prove the inequality…

Geometric Topology · Mathematics 2026-04-24 Alexander Dranishnikov

In this work, we consider the following problem: given a digraph $G=(V,E)$, for each vertex $v$, we want to compute the number of vertices reachable from $v$. In other words, we want to compute the out-degree of each vertex in the…

Computational Complexity · Computer Science 2016-02-08 Michele Borassi

We compute the complexity, z-complexity, and support varieties of the (thick) Kac modules for the Lie superalgebras of type P. We also show the complexity and the z-complexity have geometric interpretations in terms of support and…

Representation Theory · Mathematics 2020-08-12 Brian D. Boe , Jonathan R. Kujawa

By using a selective filtration argument, we prove that the satisfiability problem of the unimodal logic of density is in $EXPTIME$. By using a tableau-like approach, we prove that the satisfiability problem of the bimodal logic of weak…

Logic in Computer Science · Computer Science 2025-07-16 Philippe Balbiani , Olivier Gasquet

In this article we study the higher topological complexity ${\sf TC}_r(X)$ in the case when $X$ is an aspherical space, $X=K(\pi, 1)$ and $r\ge 2$. We give a characterisation of ${\sf TC}_r(K(\pi, 1))$ in terms of classifying spaces for…

Algebraic Topology · Mathematics 2019-03-01 Michael Farber , John Oprea

We show how a certain type of CW simplicial resolutions of space by wedges of spheres may be constructed for any topological space, and how such resolutions yield an obstruction theory for a given space X to be a loop space.

Algebraic Topology · Mathematics 2007-05-23 David Blanc

We prove a topological rigidity theorem for closed hypersurfaces of the Euclidean sphere and of an elliptic space form. It asserts that, under a lower bound hypothesis on the absolute value of the principal curvatures, the hypersurface is…

Differential Geometry · Mathematics 2018-09-28 Eduardo Longa , Jaime Ripoll

Pfister and Sullivan proved that if a topological dynamical system $(X,T)$ satisfies almost product property and uniform separation property, then for each nonempty compact %convex subset $K$ of invariant measures, the entropy of saturated…

Dynamical Systems · Mathematics 2021-07-28 Xiaobo Hou , Xueting Tian , Yiwei Zhang

This is an extended abstract presenting new results on the topological complexity of omega-powers (which are included in a paper "Classical and effective descriptive complexities of omega-powers" available from arXiv:0708.4176) and…

Logic in Computer Science · Computer Science 2008-09-11 Olivier Finkel , Dominique Lecomte

We examine the rationality conjecture which states that (a) the formal power series $\sum_{r\ge 1} \tc_{r+1}(X)\cdot x^r$ represents a rational function of $x$ with a single pole of order 2 at $x=1$ and (b) the leading coefficient of the…

Algebraic Topology · Mathematics 2020-03-11 Michael Farber , Daisuke Kishimoto , Donald Stanley

Given $n$ weighted points (positive or negative) in $d$ dimensions, what is the axis-aligned box which maximizes the total weight of the points it contains? The best known algorithm for this problem is based on a reduction to a related…

Data Structures and Algorithms · Computer Science 2016-03-04 Arturs Backurs , Nishanth Dikkala , Christos Tzamos

We study topology in Quantum Chromodynamics at high temperatures by means of lattice calculations. Simulations are performed with $N_f=2+1+1$ Wilson twisted mass fermions at maximal twist with physical quark masses, and temperatures…

High Energy Physics - Lattice · Physics 2025-09-08 A. Yu. Kotov , M. P. Lombardo , A. Trunin

Based on [1], we study the complexity of horizontality in each twistor space $\hat{E}_{\varepsilon}$ associated with an oriented vector bundle $E$ of rank $4$ with a positive-definite metric over the $2$-torus $T^2$, and obtain…

Differential Geometry · Mathematics 2026-01-26 Naoya Ando , Anri Yonezaki

In a topological dynamical system the complexity of an orbit is a measure of the amount of information (algorithmic information content) that is necessary to describe the orbit. This indicator is invariant up to topological conjugation. We…

Dynamical Systems · Mathematics 2007-05-23 Stefano Galatolo

In a graph $G=(V,E)$, a bisection $(X,Y)$ is a partition of $V$ into sets $X$ and $Y$ such that $|X|\le |Y|\le |X|+1$. The size of $(X,Y)$ is the number of edges between $X$ and $Y$. In the Max Bisection problem we are given a graph…

Data Structures and Algorithms · Computer Science 2010-05-18 Gregory Gutin , Anders Yeo
‹ Prev 1 4 5 6 7 8 10 Next ›