English
Related papers

Related papers: Classification theorem for strong triangle blockin…

200 papers

We describe small dominating sets of the incidence graphs of finite projective planes by establishing a stability result which shows that dominating sets are strongly related to blocking and covering sets. Our main result states that if a…

Combinatorics · Mathematics 2016-12-19 Tamás Héger , Zoltán Lóránt Nagy

We define three types of upper (and lower) triangular blocked tensors, which are all generalizations of the triangular blocked matrices. We study some basic properties and characterizations of these three types of triangular blocked…

Rings and Algebras · Mathematics 2016-04-29 Jiayu Shao , Lihua You

A partial Steiner triple system of order n is sequenceable if there is a sequence of length n of its distinct points such that no proper segment of the sequence is a union of point-disjoint blocks. We prove that if a partial Steiner triple…

Combinatorics · Mathematics 2019-07-26 Brian Alspach , Donald L. Kreher , Adrián Pastine

A combinatorial block design $D$ is called $3$-pyramidal if there exists a subgroup $G$ of $\mbox{Aut}(D)$ fixing $3$ points and acting regularly on the other points. If this happens, we say that the design is $3$-pyramidal under $G$. In…

Group Theory · Mathematics 2023-02-28 Xiaofang Gao , Martino Garonzi

We construct a finite subgroup of Brauer-Manin obstruction for detecting the existence of integral points on integral models of homogeneous spaces of linear algebraic groups of multiplicative type. As application, the strong approximation…

Number Theory · Mathematics 2012-08-21 Dasheng Wei , Fei Xu

We complete the explicit study of a three-fold divisorial contraction whose exceptional divisor contracts to a point, by treating the case where the point downstairs is a singularity of index $n \ge 2$. We prove that if this singularity is…

Algebraic Geometry · Mathematics 2007-05-23 Masayuki Kawakita

The Splitter Theorem states that, if $N$ is a 3-connected proper minor of a 3-connected matroid $M$ such that, if $N$ is a wheel or whirl then $M$ has no larger wheel or whirl, respectively, then there is a sequence $M_0,..., M_n$ of…

Combinatorics · Mathematics 2015-09-15 S. R. Kingan , Manoel Lemos

We show that every planar triangulation on $n>10$ vertices has a dominating set of size $n/7=n/3.5$. This approaches the $n/4$ bound conjectured by Matheson and Tarjan [MT'96], and improves significantly on the previous best bound of…

Combinatorics · Mathematics 2023-10-24 Aleksander B. G. Christiansen , Eva Rotenberg , Daniel Rutschmann

The aim of this paper is to establish strong convergence theorems for a strongly relatively nonexpansive sequence in a smooth and uniformly convex Banach space. Then we employ our results to approximate solutions of the zero point problem…

Functional Analysis · Mathematics 2020-12-29 Koji Aoyama , Yasunori Kimura , Fumiaki Kohsaka

An incidence structure consists simply of a set P of points and a set B of blocks, with a relation of incidence between points and blocks.A symmetric (v,k,\lambda) block design is the subject of this paper. The symmetric (n^2+n+1, n+1,1)…

General Mathematics · Mathematics 2017-09-14 Mingchun Xu

It is well known that a triangulation of a closed 2-manifold is tight with respect to a field of characteristic two if and only if it is neighbourly; and it is tight with respect to a field of odd characteristic if and only if it is…

Geometric Topology · Mathematics 2018-10-24 Bhaskar Bagchi , Basudeb Datta , Jonathan Spreer

We study finite and countably infinite systems of stochastic differential equations, in which the drift and diffusion coefficients of each component (particle) are determined by its rank in the vector of all components of the solution. We…

Probability · Mathematics 2011-09-20 Tomoyuki Ichiba , Ioannis Karatzas , Mykhaylo Shkolnikov

We show that every $n$-vertex triangulation has a connected dominating set of size at most $10n/21$. Equivalently, every $n$ vertex triangulation has a spanning tree with at least $11n/21$ leaves. Prior to the current work, the best known…

Combinatorics · Mathematics 2024-04-05 Prosenjit Bose , Vida Dujmović , Hussein Houdrouge , Pat Morin , Saeed Odak

We show that the number of unit-area triangles determined by a set $S$ of $n$ points in the plane is $O(n^{20/9})$, improving the earlier bound $O(n^{9/4})$ of Apfelbaum and Sharir [Discrete Comput. Geom., 2010]. We also consider two…

Combinatorics · Mathematics 2015-04-14 Orit E. Raz , Micha Sharir

A novel approach to building strong starters in cyclic groups of orders $n$ divisible by 3 from starters of smaller orders is presented. A strong starter in $Z_n$ ($n$ odd) is a partition of the set $\{1,2,\dots,n-1\}$ into pairs…

Combinatorics · Mathematics 2026-03-10 Oleg Ogandzhanyants , Sergey Sadov , Margo Kondratieva

In 1996, Matheson and Tarjan conjectured that any n-vertex triangulation with n sufficiently large has a dominating set of size at most n/4. We prove this for graphs of maximum degree 6.

Combinatorics · Mathematics 2010-06-09 Erika L. C. King , Michael J. Pelsmajer

Let $P$ be a set of $n$ points in $\mathbb{R}^d$ and $\mathcal{F}$ be a family of geometric objects. We call a point $x \in P$ a strong centerpoint of $P$ w.r.t $\mathcal{F}$ if $x$ is contained in all $F \in \mathcal{F}$ that contains more…

Computational Geometry · Computer Science 2015-02-27 Pradeesha Ashok , Sathish Govindarajan

We introduce and study a family of groups $\mathbf{BB}_n$, called the blocked-braid groups, which are quotients of Artin's braid groups $\mathbf{B}_n$, and have the corresponding symmetric groups $\Sigma_n$ as quotients. They are defined by…

Category Theory · Mathematics 2013-07-23 D. Maglia , N. Sabadini , R. F. C. Walters

In this paper we introduce a corrected extension of Burton's theory of large contractions in the context of triangle-perimeter contractions introduced by Petrov. Combining these two lines of research, we prove a fixed point result for large…

Dynamical Systems · Mathematics 2026-05-14 Ovidiu Popescu

Let P be a set of n points in $\mathbb{R}^d$. A point x is said to be a centerpoint of P if x is contained in every convex object that contains more than $dn\over d+1$ points of P. We call a point x a strong centerpoint for a family of…

Computational Geometry · Computer Science 2012-08-15 Pradeesha Ashok , Umair Azmi , Sathish Govindarajan