English
Related papers

Related papers: Codimension two and three Kneser Transversals

200 papers

Kneser-Haken Finiteness asserts that for each compact 3-manifold M there is an integer c(M) such that any collection of k>c(M) closed, essential, 2-sided surfaces in M must contain parallel elements. We show here that if M is closed then…

Geometric Topology · Mathematics 2007-05-23 David Bachman

Let $(K,v)$ be a valued field. Take an extension of $v$ to a fixed algebraic closure $L$ of $K$. In this paper we show that an element $a\in L$ admits a complete distinguished chain over $K$ if and only if the extension $(K(a)|K,v)$ is…

Commutative Algebra · Mathematics 2025-04-30 Arpan Dutta , Rumi Ghosh

A $d$-ary quasigroup of order $n$ is a $d$-ary operation over a set of cardinality $n$ such that the Cayley table of the operation is a $d$-dimensional latin hypercube of the same order. Given a binary quasigroup $G$, the $d$-iterated…

Combinatorics · Mathematics 2017-09-12 Anna Taranenko

We examine the minimal magnitude of perturbations necessary to change the number $N$ of static equilibrium points of a convex solid $K$. We call the normalized volume of the minimally necessary truncation robustness and we seek shapes with…

Metric Geometry · Mathematics 2019-02-20 G. Domokos , Z. Lángi

A stacked $d$-sphere $S$ is the boundary complex of a stacked $(d+1)$-ball, which is obtained by taking cone over a free $d$-face repeatedly from a $(d+1)$-simplex. A stacked sphere $S$ is called linear if every cone is taken over a face…

Combinatorics · Mathematics 2023-05-16 Minho Cho , Jinha Kim

Let $\mathbb{K}$ be a non-Archimedean (complete) valued field satisfying \begin{align*} \left|\sum_{j=1}^{n}\lambda_j^2\right|=\max_{1\leq j \leq n}|\lambda_j|^2, \quad \forall \lambda_j \in \mathbb{K}, 1\leq j \leq n, \forall n \in…

Information Theory · Computer Science 2022-10-14 K. Mahesh Krishna

For every integer $k\geq 2$ and every $R>1$ one can find a dimension $n$ and construct a symmetric convex body $K\subset\mathbb{R}^n$ with $\text{diam}\,Q_{k-1}(K)\geq R\cdot\text{diam}\,Q_k(K)$, where $Q_k(K)$ denotes the $k$-convex hull…

Metric Geometry · Mathematics 2025-10-01 Davide Ravasini

An axis-parallel $d$-dimensional box is a cartesian product $I_1\times I_2\times \dots \times I_b$ where $I_i$ is a closed sub-interval of the real line. For a graph $G = (V,E)$, the $boxicity \ of \ G$, denoted by $\text{box}(G)$, is the…

Combinatorics · Mathematics 2021-05-07 Marco Caoduro , Lyuben Lichev

We prove that for any partition $(\lambda_1,...,\lambda_{d^2})$ of size $\ell d$ there exists $k\ge 1$ such that the tensor square of the irreducible representation of the symmetric group $S_{k\ell d}$ with respect to the rectangular…

Group Theory · Mathematics 2012-06-12 Peter Bürgisser , Matthias Christandl , Christian Ikenmeyer

Let X be a smooth algebraic curve of genus g>=2. A stable vector bundle over X of degree d, rank n with at least k sections is called a Brill-Noether bundle of type (n,d,k). By tensoring coherent systems, we prove that most of the known…

Algebraic Geometry · Mathematics 2007-11-27 L. Brambila-Paz , Angela Ortega

Hadwiger's theorem is a Helly-type theorem involving common transversals to families of convex sets instead of common intersections. Subsequently, Pollack and Wenger identified a necessary and sufficient condition, called a consistent…

Combinatorics · Mathematics 2025-12-03 Ilani Axelrod-Freed , João Pedro Carvalho , Yuki Takahashi

Given a metric space $(X,d)$, a set of terminals $K\subseteq X$, and a parameter $t\ge 1$, we consider metric structures (e.g., spanners, distance oracles, embedding into normed spaces) that preserve distances for all pairs in $K\times X$…

Data Structures and Algorithms · Computer Science 2018-02-23 Michael Elkin , Ofer Neiman

A line L is a transversal to a family F of convex objects in R^d if it intersects every member of F. In this paper we show that for every integer d>2 there exists a family of 2d-1 pairwise disjoint unit balls in R^d with the property that…

Computational Geometry · Computer Science 2009-06-17 Otfried Cheong , Xavier Goaoc , Andreas Holmsen

Metric spaces $(X, d)$ are ubiquitous objects in mathematics and computer science that allow for capturing (pairwise) distance relationships $d(x, y)$ between points $x, y \in X$. Because of this, it is natural to ask what useful…

Computational Geometry · Computer Science 2023-08-10 Willow Barkan-Vered , Huck Bennett , Amir Nayyeri

Let $m\in\mathbb N_{\ge 2}$, and let $\mathcal K=\{K_\lambda: \lambda\in(0, 1/m]\}$ be a class of Cantor sets, where $K_{\lambda}=\{\sum_{i=1}^\infty d_i\lambda^i: d_i\in\{0,1,\ldots, m-1\}, i\ge 1\}$. We investigate in this paper the…

Dynamical Systems · Mathematics 2022-02-16 Kan Jiang , Derong Kong , Wenxia Li

We consider holomorphic mappings $H$ between a smooth real hypersurface $M\subset \bC^{n+1}$ and another $M'\subset \bC^{N+1}$ with $N\geq n$. We provide conditions guaranteeing that $H$ is transversal to $M'$ along all of $M$. In the…

Complex Variables · Mathematics 2020-06-15 Peter Ebenfelt , Duong Ngoc Son

We present a new generalization of the classical trisecant lemma. Our approach is quite different from previous generalizations. Let $X$ be an equidimensional projective variety of dimension $d$. For a given $k \leq d + 1$, we are…

Algebraic Geometry · Mathematics 2020-01-14 Yirmeyahu J. Kaminski , Alexei Kanel-Belov , Mina Teicher

We prove new upper and lower bounds on transversal numbers of several classes of simplicial complexes. Specifically, we establish an upper bound on the transversal numbers of pure simplicial complexes in terms of the number of vertices and…

Combinatorics · Mathematics 2025-10-09 Isabella Novik , Hailun Zheng

For integers $k\geq 1$ and $n\geq 2k+1$, the Kneser graph $K(n,k)$ is the graph whose vertices are the $k$-element subsets of $\{1,\ldots,n\}$ and whose edges connect pairs of subsets that are disjoint. The Kneser graphs of the form…

Combinatorics · Mathematics 2021-08-11 Torsten Mütze , Jerri Nummenpalo , Bartosz Walczak

Given integers $\Delta\ge 2$ and $t\ge 2\Delta$, suppose there is a graph of maximum degree $\Delta$ and a partition of its vertices into blocks of size at least $t$. By a seminal result of Haxell, there must be some independent set of the…

Combinatorics · Mathematics 2024-07-08 Pjotr Buys , Ross J. Kang , Kenta Ozeki