English
Related papers

Related papers: Topological obstructions for vertex numbers of Min…

200 papers

The purpose of this paper is to prove that the Mirkovic-Vilonen (MV for short) polytope corresponding to the tensor product of two arbitrary MV polytopes is contained in the Minkowski sum of these two MV polytopes. This generalizes the…

Quantum Algebra · Mathematics 2010-10-06 Syu Kato , Satoshi Naito , Daisuke Sagaki

We consider the summability of one- and multi-dimensional trigonometric Fourier series. The Fej{\'e}r and Riesz summability methods are investigated in detail. Different types of summation and convergence are considered. We will prove that…

Classical Analysis and ODEs · Mathematics 2012-06-11 Ferenc Weisz

We establish new lower bounds for the Tur\'an and Zarankiewicz numbers of certain apex partite hypergraphs. Given a $(d-1)$-partite $(d-1)$-uniform hypergraph $\mathcal{H}$, let $\mathcal{H}(k)$ be the $d$-partite $d$-uniform hypergraph…

Combinatorics · Mathematics 2025-10-10 Qiyuan Chen , Hong Liu , Ke Ye

We study obstructions to the existence of Riemannian metrics of positive scalar curvature on closed smooth manifolds arising from torsion classes in the integral homology of their fundamental groups. As an application, we construct new…

Differential Geometry · Mathematics 2024-07-31 Misha Gromov , Bernhard Hanke

Following Ghomi and Tabachnikov we study topological obstructions to totally skew embeddings of a smooth manifold M in Euclidean spaces. This problem is naturally related to the question of estimating the geometric dimension of the stable…

Algebraic Topology · Mathematics 2010-11-23 Djordje Baralic , Branislav Prvulovic , Gordana Stojanovic , Sinisa Vrecica , Rade Zivaljevic

Przytycki has shown that the size $\mathcal{N}_{k}(S)$ of a maximal collection of simple closed curves that pairwise intersect at most $k$ times on a topological surface $S$ grows at most as a polynomial in $|\chi(S)|$ of degree…

Geometric Topology · Mathematics 2016-10-21 Tarik Aougab , Ian Biringer , Jonah Gaster

Let $G$ be a compact connected Lie group and let $\xi,\nu$ be complex vector bundles over the classifying space $BG$. The problem we consider is whether $\xi$ contains a subbundle which is isomorphic to $\nu$. The necessary condition is…

Algebraic Topology · Mathematics 2016-09-21 Wojciech Lubawski , Krzysztof Ziemiański

We aim to find orientations of mixed graphs optimizing the total reachability, a problem that has applications in causality and biology. For given a digraph $D$, we use $P(D)$ for the set of ordered pairs of distinct vertices in $V(D)$ and…

Computational Complexity · Computer Science 2025-09-24 Florian Hörsch

We prove that there exists a>0 such that for any integer d>2 and any topological types S_1,...,S_n of plane curve singularities, satisfying $\mu(S_1)+...+\mu(S_n) \leq ad^2$, there exists a reduced irreducible plane curve of degree d with…

alg-geom · Mathematics 2009-10-30 Gert-Martin Greuel , Christoph Lossen , Eugenii Shustin

Erd\H{o}s and Purdy, and later Agarwal and Sharir, conjectured that any set of $n$ points in $\mathbb R^{d}$ determine at most $Cn^{d/2}$ congruent $k$-simplices for even $d$. We obtain the first significant progress towards this…

Combinatorics · Mathematics 2021-12-21 Nora Frankl , Andrey Kupavskii

We present a simplified formulation of open intersection numbers, as an alternative to the theory initiated by Pandharipande, Solomon and Tessler. The relevant moduli spaces consist of Riemann surfaces (either with or without boundary) with…

Symplectic Geometry · Mathematics 2016-09-30 Brad Safnuk

This dissertation investigates the geometric combinatorics of convex polytopes and connections to the behavior of the simplex method for linear programming. We focus our attention on transportation polytopes, which are sets of all tables of…

Combinatorics · Mathematics 2010-06-15 Edward D. Kim

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Computational Complexity · Computer Science 2025-11-21 Srinivas Balaji Bollepalli

We demonstrate the existence of numerous non-spin 4-manifolds for which the smooth Nielsen realization problem fails; namely, there exist finite subgroups of their mapping class groups that cannot be realized by any group of…

Geometric Topology · Mathematics 2023-10-13 Mihail Arabadji , R. Inanc Baykur

We find upper bounds for the degrees of vertices and Steiner points in Steiner Minimal Trees in the d-dimensional Banach spaces \ell_p^d independent of d. This is in contrast to Minimal Spanning Trees, where the maximum degree of vertices…

Metric Geometry · Mathematics 2008-03-05 K. J. Swanepoel

Generalizing a result (the case $k = 1$) due to M. A. Perles, we show that any polytopal upper bound sphere of odd dimension $2k + 1$ belongs to the generalized Walkup class ${\cal K}_k(2k + 1)$, i.e., all its vertex links are $k$-stacked…

Geometric Topology · Mathematics 2014-01-14 Bhaskar Bagchi , Basudeb Datta

Let $\mathcal{A}$ be the subdivision of $\mathbb{R}^d$ induced by $m$ convex polyhedra having $n$ facets in total. We prove that $\mathcal{A}$ has combinatorial complexity $O(m^{\lceil d/2 \rceil} n^{\lfloor d/2 \rfloor})$ and that this…

Computational Geometry · Computer Science 2025-10-16 Boris Aronov , Sang Won Bae , Sergio Cabello , Otfried Cheong , David Eppstein , Christian Knauer , Raimund Seidel

We describe some combinatorial problems in finite projective planes and indicate how R\'edei's theory of lacunary polynomials can be applied to them.

Combinatorics · Mathematics 2007-05-23 Aart Blokhuis

We consider the distribution of polygonal paths joining the partial sums of normalized Kloosterman sums modulo an increasingly high power p^n of a fixed odd prime p, a pure depth-aspect analogue of theorems of Kowalski-Sawin and…

Number Theory · Mathematics 2020-05-19 Djordje Milićević , Sichen Zhang

We obtain a polynomial upper bound in the finite-field version of the multidimensional polynomial Szemer\'{e}di theorem for distinct-degree polynomials. That is, if $P_1, ..., P_t$ are nonconstant integer polynomials of distinct degrees and…

Number Theory · Mathematics 2021-11-10 Borys Kuca
‹ Prev 1 8 9 10 Next ›