Searcharxiv⌕ Search

arXiv subjects

Aleksandra S. Dimitrijević Blagojević

Publications and source records attributed to Aleksandra S. Dimitrijević Blagojević.

3 recordsLinked to original sources

Topology of the Grünbaum--Hadwiger--Ramos problem for mass assignments

In this paper, motivated by recent work of Schnider and Axelrod-Freed \& Soberón, we study an extension of the classical Grünbaum--Hadwiger--Ramos mass partition problem to mass assignments. Using the Fadell--Husseini index theory we prove that for a given family of $j$ mass assignments $μ_1,\dots,μ_j$ on the Grassmann manifold $G_{\ell}(\R^d)$ and a given integer $k\geq 1$ there exist a linear subspace $L\in G_{\ell}(\R^d)$ and $k$ affine hyperplanes in $L$ that equipart the masses $μ_1^L,\dots,μ_j^L$ assigned to the subspace $L$, provided that $d\geq j + (2^{k-1}-1)2^{\lfloor\log_2j\rfloor}$.

math.AT↗

The topological transversal Tverberg theorem plus constraints

In this paper we use the strength of the constraint method in combination with a generalized Borsuk-Ulam type theorem and a cohomological intersection lemma to show how one can obtain many new topological transversal theorems of Tverberg type. In particular, we derive a topological generalized transversal Van Kampen-Flores theorem and a topological transversal weak colored Tverberg theorem.

math.CO↗

Polynomial partitioning for several sets of varieties

We give a new, systematic proof for a recent result of Larry Guth and thus also extend the result to a setting with several families of varieties: For any integer $D\geq 1$ and any collection of sets $Γ_1,\ldots,Γ_j$ of low-degree $k$-dimensional varieties in $\mathbb{R}^n$ there exists a non-zero polynomial $p\in\mathbb{R}[X_1,\ldots,X_n]$ of degree at most $D$ so that each connected component of $\mathbb{R}^n{\setminus}Z(p)$ intersects $O(jD^{k-n}|Γ_i|)$ varieties of $Γ_i$, simultaneously for every $1\leq i\leq j$. For $j=1$ we recover the original result by Guth. Our proof, via an index calculation in equivariant cohomology, shows how the degrees of the polynomials used for partitioning are dictated by the topology, namely by the Euler class being given in terms of a top Dickson polynomial.

math.AT↗