English
Related papers

Related papers: Counting multijoints

200 papers

Let $S$ be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset $S'\subseteq S$ is said to be \emph{balanced} if $S'$ contains the same amount of elements of $S$ from each of the colors. We study several…

Computational Geometry · Computer Science 2017-08-22 Sergey Bereg , Matias Korman , Rodrigo I. Silveira , Ferran Hurtado , Dolores Lara , Jorge Urrutia , Mikio Kano , Carlos Seara , Kevin Verbeek

We prove the following variant of Levi's Enlargement Lemma: for an arbitrary arrangement $\mathcal{A}$ of $x$-monotone pseudosegments in the plane and a pair of points $a,b$ with distinct $x$-coordinates and not on the same pseudosegment,…

Combinatorics · Mathematics 2025-10-02 Jan Kynčl , Jan Soukup

Menger's Edge Theorem asserts that there exist $k$ pairwise edge-disjoint paths between two vertices in an undirected graph if and only if a deletion of any $k-1$ or less edges does not disconnect these two vertices. Alternatively, there…

Combinatorics · Mathematics 2022-04-05 Avraham Goldstein

Closed 3-string braids admit many bandings to two-bridge links. By way of the Montesinos Trick, this allows us to construct infinite families of knots in the connected sum of lens spaces L(r,1) # L(s,1) that admit a surgery to a lens space…

Geometric Topology · Mathematics 2013-06-05 Kenneth L. Baker

Sums of the form $\sum_{q \leq N_1 < \cdots < N_m \leq n}{a_{(m);N_m}\cdots a_{(2);N_2}a_{(1);N_1}}$ date back to the sixteen century when Vi\`ete illustrated that the relation linking the roots and coefficients of a polynomial had this…

Combinatorics · Mathematics 2022-04-25 Roudy El Haddad

We show that a line arrangement in the complex projective plane supports a nontrivial resonance variety if and only if it is the underlying arrangement of a "multinet," a multi-arrangement with a partition into three or more equinumerous…

Algebraic Geometry · Mathematics 2007-05-23 Michael Falk , Sergey Yuzvinsky

The note is devoted to multiple mixing, spectrum, rank and self-joinings of measure-preserving transformations. We recall famous open problems, discuss related questions and some known results. A hypothetical example of an automorphism of…

Dynamical Systems · Mathematics 2024-05-07 Valery V. Ryzhikov

Let R=k[x_1,...,x_n] be a polynomial ring over a field k. Let J={j_1,...,j_t} be a subset of [n]={1,...,n}, and let m_J denote the ideal (x_{j_1},...,x_{j_t}) of R. Given subsets J_1,...,J_s of [n] and positive integers a_1,...,a_s, we…

Commutative Algebra · Mathematics 2007-05-23 Christopher A. Francisco , Adam Van Tuyl

In this paper, we study the algebraic form of the symmetric generalized Lam\'e equations which have finite projective monodromy groups. In particular, we consider equations with $3$ regular singular points on a flat torus $T$ which takes…

Algebraic Geometry · Mathematics 2016-11-23 You-Cheng Chou

We consider the non-crossing connectors problem, which is stated as follows: Given n simply connected regions R_1,...,R_n in the plane and finite point sets P_i subset of R_i for i=1,...,n, are there non-crossing connectors y_i for…

Computational Geometry · Computer Science 2012-01-05 Jan Kratochvíl , Torsten Ueckerdt

We analyze the sequence $\mathcal L^*_J(I)$ of mixed \L ojasiewicz exponents attached to any pair $I,J$ of monomial ideals of finite colength of the ring of analytic function germs $(\mathbb C^n,0)\to \mathbb C$. In particular, we obtain a…

Commutative Algebra · Mathematics 2019-04-11 Carles Bivià-Ausina

Motivated by the well-known conjecture of Ryser which relates maximum matchings to minimum vertex covers in $r$-partite $r$-uniform hypergraphs, Lov\'asz formulated a stronger conjecture. It states that one can always reduce the matching…

Combinatorics · Mathematics 2025-07-16 Aida Abiad , Frederik Garbe , Xavier Povill , Christoph Spiegel

We obtain a new bound on the number of two-rich points spanned by an arrangement of low degree algebraic curves in $\mathbb{R}^4$. Specifically, we show that an arrangement of $n$ algebraic curves determines at most $C_\epsilon…

Combinatorics · Mathematics 2018-01-19 Larry Guth , Joshua Zahl

This is an incomplete attempt to show that the upper bound of $\lesssim n^\frac{4}{3}$ on the number unit distances determined by a large finite set of $n$ points in the plane is not sharp. The methods also say something about sets of $n$…

General Mathematics · Mathematics 2026-05-27 Steven Senger

Let K(X) be the collection of all non-zero finite dimensional subspaces of rational functions on an n-dimensional irreducible variety X. For any n-tuple L_1,..., L_n in K(X), we define an intersection index [L_1,..., L_n] as the number of…

Algebraic Geometry · Mathematics 2010-01-06 Kiumars Kaveh , A. G. Khovanskii

We prove a conjecture of D. Oberlin on the dimension of unions of lines in $\mathbb{R}^n$. If $d \geq 1$ is an integer, $0 \leq \beta \leq 1$, and $L$ is a set of lines in $\mathbb{R}^n$ with Hausdorff dimension at least $2(d-1) + \beta$,…

Classical Analysis and ODEs · Mathematics 2023-08-24 Joshua Zahl

Generalizing Heegaard splittings of 3-manifolds and trisections of 4-manifolds, we consider multisections of higher-dimensional smooth (or PL) closed orientable manifolds, namely decompositions into 1-handlebodies whose subcollections…

Geometric Topology · Mathematics 2024-12-10 Fathi Ben Aribi , Sylvain Courte , Marco Golla , Delphine Moussard

We prove that, for positive integers $n,a_1, a_2, a_3$ satisfying $a_1+a_2+a_3 = n-1$, it holds that any bipartite graph $G$ which is the union of three perfect matchings $M_1$, $M_2$, and $M_3$ on $2n$ vertices contains a matching $M$ such…

Combinatorics · Mathematics 2025-07-30 Simona Boyadzhiyska , Micha Christoph , Tibor Szabó

In part 1 (Chapter 2) we present the basic notions of Loewner theory. Here we use a modern form which was developed by F. Bracci, M. Contreras, S. D\'iaz-Madrigal et al. and which can be applied to certain higher dimensional complex…

Complex Variables · Mathematics 2015-01-20 Sebastian Schleissinger

For $0 \leq t \leq r$ let $m(t,r)$ be the maximum number $s$ such that every $t$-edge-connected $r$-graph has $s$ pairwise disjoint perfect matchings. There are only a few values of $m(t,r)$ known, for instance $m(3,3)=m(4,r)=1$, and…

Combinatorics · Mathematics 2024-03-08 Yulai Ma , Davide Mattiolo , Eckhard Steffen , Isaak H. Wolf
‹ Prev 1 4 5 6 7 8 10 Next ›