English
Related papers

Related papers: Strong marker sets and applications

200 papers

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 prove that for every $d\in \mathbb{N}$ and a graph class of bounded expansion $\mathscr{C}$, there exists some $c\in \mathbb{N}$ so that every graph from $\mathscr{C}$ admits a proper coloring with at most $c$ colors satisfying the…

Combinatorics · Mathematics 2025-05-22 Michał Pilipczuk

In 2002, D. Fon-Der-Flaass constructed a prolific family of strongly regular graphs. In this paper, we prove that for infinitely many natural numbers $n$, this family contains $n^{\Omega(n^{2/3})}$ strongly regular $n$-vertex graphs $X$…

Combinatorics · Mathematics 2023-12-04 Jinzhuan Cai , Jin Guo , Alexander L. Gavrilyuk , Ilia Ponomarenko

Fix a prime $p\geq 11$. We show that there exists a positive integer $m$ such that any subset of $\mathbb{F}_p^n\times\mathbb{F}_p^n$ containing no nontrivial configurations of the form $(x,y),(x,y+z),(x,y+2z),(x+z,y)$ must have density…

Combinatorics · Mathematics 2023-12-14 Sarah Peluse

Let p be a prime number and M a quadratic number field, M not equal to Q(\sqrt{p}) if p is congruent to 1 modulo 4. We will prove that for any positive integer d there exists a Galois extension F/Q with Galois group D_{2p} and an elliptic…

Number Theory · Mathematics 2015-10-12 Alex Bartel

In this paper, we are interested in the number of fixed points of functions $f:A^n\to A^n$ over a finite alphabet $A$ defined on a given signed digraph $D$. We first use techniques from network coding to derive some lower bounds on the…

Discrete Mathematics · Computer Science 2014-09-23 Maximilien Gadouleau , Adrien Richard , Søren Riis

The 3x+1 Conjecture asserts that the T-orbit of every positive integer contains 1, where T maps x\mapsto x/2 for x even and x\mapsto (3x+1)/2 for x odd. A set S of positive integers is sufficient if the orbit of each positive integer…

Dynamical Systems · Mathematics 2012-04-23 Keenan Monks , Kenneth G. Monks , Kenneth M. Monks , Maria Monks

We show that the following are consistent with ZFC: 1. Strongly meager sets form an ideal with the same additivity as the ideal of meager sets. 2. There exists a strong measure zero set of size > d (dominating number).

Logic · Mathematics 2007-05-23 Tomek Bartoszynski , Saharon Shelah

For an increasing sequence $(T_n)$ of one-parameter semigroups of sub Markovian kernel operators over a Polish space, we study the limit semigroup and prove sufficient conditions for it to be strongly Feller. In particular, we show that the…

Functional Analysis · Mathematics 2022-04-06 Christian Budde , Alexander Dobrick , Jochen Glück , Markus Kunze

We establish a criterion for the strong $F$-regularity of a (non-Gorenstein) Cohen-Macaulay reduced complete local ring of dimension at least $2$, containing a perfect field of prime characteristic $p$. We also describe an explicit…

Commutative Algebra · Mathematics 2018-06-13 Mordechai Katzman , Cleto B. Miranda-Neto

We prove that the noncrossing partition lattices associated with the complex reflection groups $G(d,d,n)$ for $d,n\geq 2$ admit symmetric decompositions into Boolean subposets. As a result, these lattices have the strong Sperner property…

Combinatorics · Mathematics 2017-08-08 Henri Mühle

A strongly polynomial sequence of graphs $(G_n)$ is a sequence $(G_n)_{n\in\mathbb{N}}$ of finite graphs such that, for every graph $F$, the number of homomorphisms from $F$ to $G_n$ is a fixed polynomial function of $n$ (depending on $F$).…

Combinatorics · Mathematics 2016-08-09 Andrew Goodall , Jaroslav Nesetril , Patrice Ossona de Mendez

In this paper the problem of the existence of regular nut graphs is addressed. A generalization of Fowler's Construction which is a local enlargement applied to a vertex in a graph is introduced to generate nut graphs of higher order. Let…

Combinatorics · Mathematics 2019-11-13 John Baptist Gauci , Tomaz Pisanski , Irene Sciriha

Let $F=\{\mathbf{p}_0,\ldots,\mathbf{p}_n\}$ be a collection of points in $\mathbb{R}^d.$ The set $F$ naturally gives rise to a family of iterated function systems consisting of contractions of the form $$S_i(\mathbf{x})=\lambda \mathbf{x}…

Dynamical Systems · Mathematics 2018-10-17 Simon Baker , Derong Kong

We consider the problem of existence of perfect $2$-colorings in the Doob graphs $D(m,n)$ and $4$-ary Hamming graphs $H(n,4)$. We characterize all parameters for which multifold $1$-perfect code in $D(m,n)$ exists. Also, we prove that for…

Combinatorics · Mathematics 2023-12-13 Evgeny Bespalov

We characterize the sequences of fixed point indices $\{i(f^n, p)\}_{n\ge 1}$ of fixed points that are isolated as an invariant set and continuous maps in the plane. In particular, we prove that the sequence is periodic and $i(f^n, p) \le…

Dynamical Systems · Mathematics 2016-05-30 Luis Hernandez-Corbato , Francisco R. Ruiz del Portal

We study combinatorial configurations with the associated point and line graphs being strongly regular. Examples not belonging to known classes such as partial geometries and their generalizations or elliptic semiplanes are constructed.…

Combinatorics · Mathematics 2025-09-30 Marién Abreu , Martin Funk , Vedran Krčadinac , Domenico Labbate

Regular colored graphs are dual representations of pure colored D-dimensional complexes. These graphs can be classified with respect to an integer, their degree, much like maps are characterized by the genus. We analyse the structure of…

Combinatorics · Mathematics 2016-02-02 Razvan Gurau , Gilles Schaeffer

Let $m\ge 1$, in this paper, our object of investigation is the regularity and and continuity properties of the following multilinear strong maximal operator $${\mathscr{M}}_{\mathcal{R}}(\vec{f})(x)=\sup_{\substack{R \ni x…

Classical Analysis and ODEs · Mathematics 2018-02-01 Feng Liu , Qingying Xue , Kozo Yabuta

In \cite{M18}, the first author gave a construction of strongly regular Cayley graphs on the additive group of finite fields by using three-valued Gauss periods. In particular, together with the result in \cite{BLMX}, it was shown that…

Combinatorics · Mathematics 2021-12-21 Koji Momihara , Qing Xiang
‹ Prev 1 2 3 10 Next ›