Related papers: Strong General Position

When given a class of functions and a finite collection of sets, one might be interested whether the class in question contains any function whose domain is a subset of the union of the sets of the given collection and whose restrictions to…

Fix a density d in (0,1], and let F_p^n be a finite field, where we think of p fixed and n tending to infinity. Let S be any subset of F_p^n having the minimal number of three-term progressions, subject to the constraint |S| is at least…

Let $H$ be a group acting on a simply-connected diagrammatically reducible combinatorial 2-complex $X$ with fine 1-skeleton. If the fixed point set $X^ H$ is non-empty, then it is contractible. Having fine 1-skeleton is a weaker version of…

A subset of vertices of a graph $G$ is a general position set if no triple of vertices from the set lie on a common shortest path in $G$. In this paper we introduce the general position polynomial as $\sum_{i \geq 0} a_i x^i$, where $a_i$…

Let $f \colon X \to B$ be a nonisotrivial complex elliptic surface and let $\mathcal{D} \subset X$ be an integral divisor dominating $B$. We study finiteness related properties of generalized $(S, \mathcal{D})$-integral sections $\sigma…

In [10] Benjamin Klopsch and Ilir Snopce posted the conjecture that for $p\geq 3$ and $G$ a torsion-free pro-$p$ group $d(G)=\dim (G)$ is a sufficient and necessary condition for the pro-$p$ group $G$ to be uniform. They pointed out that…

A set $D$ of vertices of a simple graph $G=(V,E)$ is a strong dominating set, if for every vertex $x\in \overline{D}=V\setminus D$ there is a vertex $y\in D$ with $xy\in E(G)$ and $deg(x)\leq deg(y)$. The strong domination number…

A set of edges $X\subseteq E(G)$ of a graph $G$ is an edge general position set if no three edges from $X$ lie on a common shortest path. The edge general position number ${\rm gp}_{\rm e}(G)$ of $G$ is the cardinality of a largest edge…

Let $\alpha(\mathbb{F}_q^d,p)$ denote the maximum size of a general position set in a $p$-random subset of $\mathbb{F}_q^d$. We determine the order of magnitude of $\alpha(\mathbb{F}_q^2,p)$ up to polylogarithmic factors for all possible…

Generalizations of Redfield's master theorem and superposition theorem are proved by using decomposition of the tensor product of several induced monomial representations of the symmetric group $S_d$ into transitive constituents. As direct…

We show how the relatively initial or relatively terminal fixed points for a well-behaved functor $F$ form a pair of adjoint functors between $F$-coalgebras and $F$-algebras. We use the language of locally presentable categories to find…

A graph $G$ contains a strong parity factor $F$ if for every subset $X\subseteq V(G)$ with $|X|$ even, $G$ has a spanning subgraph $F$ satisfying $\delta(F)\geq1$, $d_F(u)\equiv1$ (mod 2) for any $u\in X$, and $d_F(v)\equiv0$ (mod 2) for…

A packing of subsets $\mathcal S_1,..., \mathcal S_n$ in a group $G$ is a sequence $(g_1,...,g_n)$ such that $g_1\mathcal S_1,...,g_n\mathcal S_n$ are disjoint subsets of $G$. We give a formula for the number of packings if the group $G$ is…

Inspired by a chessboard puzzle of Dudeney, the general position problem in graph theory asks for a largest set $S$ of vertices in a graph such that no three elements of $S$ lie on a common shortest path. The number of vertices in such a…

For a fixed degree sequence $\mathcal{D}=(d_1,...,d_n)$, let $G(\mathcal{D})$ be a uniformly chosen (simple) graph on $\{1,...,n\}$ where the vertex $i$ has degree $d_i$. In this paper we determine whether $G(\mathcal{D})$ has a giant…

A point $x \in \mathbb{F}^n$ is a joint formed by a finite collection $\mathfrak{L}$ of lines in $\mathbb{F}^n$ if there exist at least $n$ lines in $\mathfrak{L}$ through $x$ that span $\mathbb{F}^n$. It is known that there are $\lesssim_n…

We consider the rigidity and global rigidity of bar-joint frameworks in Euclidean $d$-space under additional dilation constraints in specified coordinate directions. In this setting we obtain a complete characterisation of generic rigidity.…

The strong geodetic problem is a recent variation of the classical geodetic problem. For a graph $G$, its strong geodetic number ${\rm sg}(G)$ is the cardinality of a smallest vertex subset $S$, such that each vertex of $G$ lies on one…

A graph $G=(V,E)$ is $d$-sparse if each subset $X\subseteq V$ with $|X|\geq d$ induces at most $d|X|-{{d+1}\choose{2}}$ edges in $G$. Maxwell showed in 1864 that a necessary condition for a generic bar-and-joint framework with at least…

We establish three major fixed-point theorems for functions satisfying an odd power type contractive condition in G-metric spaces. We first consider the case of a single mapping, followed by that of a triplet of mappings and we conclude by…