Related papers: A lower bound for higher topological complexity of…
Let G be a discrete group. We give methods to compute for a generalized (co-)homology theory its values on the Borel construction (EG x X)/G of a proper G-CW-complex X satisfying certain finiteness conditions. In particular we give formulas…
We prove the lower bound R(M_m) \geq 3/2 m^2 - 2 on the border rank of m x m matrix multiplication by exhibiting explicit representation theoretic (occurence) obstructions in the sense of the geometric complexity theory (GCT) program. While…
We construct combinatorial bases of the $T$-equivariant ($T$ is the maximal torus) cohomology $H^\bullet_T(\Sigma,k)$ of the Bott-Samelson variety $\Sigma$ under some mild restrictions on the field of coefficients $k$. This bases allow us…
The notion of higher order dual varieties of a projective variety is a natural generalization of the classical notion of projective duality, introduced by Piene in 1983. In this paper we study higher order dual varieties of projective toric…
We study here the higher derived limits of mod $p$ cohomology on the centric orbit category of a saturated fusion system on a finite $p$-group. It is an open problem whether all such higher limits vanish. This is known in many cases,…
We define a relative version of tiling cohomology for the purpose of comparing the topology of tiling spaces when one is a factor of the other. We illustrate this with examples, and outline a method for computing the cohomology of tiling…
We show that in all homotopy classes of mappings from complex projective space to Riemannian manifolds, the infimum of the energy is proportional to the infimal area in the homotopy class of mappings of the 2-sphere which represents the…
Complex molecules and mesoscopic structures are naturally described by general networks of elementary building blocks and tight-binding is one of the simplest quantum model suitable for studying the physical properties arising from the…
In part I we reduced the arithmetic (characteristic zero) version of the P \not \subseteq NP conjecture to the problem of showing that a variety associated with the complexity class NP cannot be embedded in the variety associated the…
We prove that, if n is a 2-power, the unordered configuration space C(RP^n,2) cannot be immersed in R^{4n-2} nor embedded as a closed subspace of R^{4n-1}, optimal results, while if n is not a 2-power, C(RP^n,2) can be immersed in R^{4n-3}.…
In 2006, Kawaguchi proved a lower bound for height of h(f(P)) when f is a regular affine automorphism of A^2, and he conjectured that a similar estimate is also true for regular affine automorphisms of A^n for n>2. In this paper we prove…
We first study the higher version of the relative topological complexity by using the homotopic distance. We also introduced the generalized version of the relative topological complexity of a topological pair on both the Schwarz genus and…
A topology optimization formulation including a model of the layer-by-layer additive manufacturing (AM) process is considered. Defined as a multi-objective minimization problem, the formulation accounts for the performance and cost of both…
We study bounds on nilpotence in H*(BG), the mod p cohomology of the classifying space of a compact Lie group G. Part of this is a report of our previous work on this problem, updated to reflect the consequences of Peter Symonds recent…
We establish the Hodge conjecture for the top dimensional cohomology group with integer coefficients of any $q$-complete complex manifold $X$ with $q<\dim X$. This holds in particular for the complement $X=\mathbb{C}\mathbb{P}^n\setminus A$…
We introduce the digital projective product spaces based on Davis' projective product spaces. We determine an upper bound for the digital LS-category of the digital projective product spaces. In addition, we obtain an upper bound for the…
In this paper, we investigate discrete topological complexity $TC(K)$ introduced for situations where the configuration space possesses a simplicial structure. %Simplicial complexes are well-known and commonly used in programming for…
The topological complexity of a path-connected space $X,$ denoted $TC(X),$ can be thought of as the minimum number of continuous rules needed to describe how to move from one point in $X$ to another. The space $X$ is often interpreted as a…
We show that the computational complexity of Riemann mappings can be bounded by the complexity needed to compute conformal mappings locally at boundary points. As a consequence we get first formally proven upper bounds for…
We shall give an explicit estimate of the lower bound of the Bergman kernel associated to a positive line bundle. In the compact Riemann surface case, our result can be seen as an explicit version of Tian's partial $C^0$-estimate.