English
Related papers

Related papers: On structure theorems and non-saturated examples

200 papers

Let $G$ be a finite group. By a sequence over $G$, we mean a finite unordered sequence of terms from $G$, where repetition is allowed, and we say that it is a product-one sequence if its terms can be ordered such that their product equals…

Combinatorics · Mathematics 2019-05-06 Jun Seok Oh , Qinghai Zhong

A topological dynamical system $(X,T)$ is called CF-Nil($k$) if it is strictly ergodic and the maximal measurable and maximal topological $k$-step pro-nilfactors coincide as measure preserving systems. Through constructing specific…

Dynamical Systems · Mathematics 2025-10-21 Kangbo Ouyang , Qinqi Wu

A point set $P \subset {\Bbb{R}}^d$ is {\it separated} if the minimum distance between any two points in $P$ is at least $1$. For $d \ne 4,5,$ we determine, for every $t_1,t_2 \ge 1$, and for $n$ at least a suitable $n_d$, the maximum…

Metric Geometry · Mathematics 2025-10-07 P. Erdős , E. Makai, , J. Pach

Finding a d-regular spanning subgraph (or d-factor) of a graph is easy by Tutte's reduction to the matching problem. By the same reduction, it is easy to find a minimal or maximal d-factor of a graph. However, if we require that the…

Data Structures and Algorithms · Computer Science 2013-10-10 Kamiel Cornelissen , Ruben Hoeksma , Bodo Manthey , N. S. Narayanaswamy , C. S. Rahul

The Hadamard maximal determinant (maxdet) problem is to find the maximum determinant D(n) of a square {+1, -1} matrix of given order n. Such a matrix with maximum determinant is called a saturated D-optimal design. We consider some cases…

Combinatorics · Mathematics 2014-07-30 Richard P. Brent

We propose new structures called almost o-minimal structures and $\mathfrak X$-structures. The former is a first-order expansion of a dense linear order without endpoints such that the intersection of a definable set with a bounded open…

Logic · Mathematics 2022-06-08 Masato Fujita

In this note, we study Togliatti systems generated by invariants of the dihedral group $D_{2d}$ acting on $k[x_{0},x_{1},x_{2}]$. This leads to the first family of non monomial Togliatti systems, which we call $GT-$systems with group…

Algebraic Geometry · Mathematics 2021-01-26 Liena Colarte-Gómez , Emilia Mezzetti , Rosa M. Miró-Roig , Martí Salat-Moltó

We investigate the structure of return-time sets determined by orbits along polynomial tuples in minimal topological dynamical systems. Building on the topological characteristic factor theory of Glasner, Huang, Shao, Weiss, and Ye, we…

In this note we study the displacement function $d_g(x):=d(gx,x)$ of an isometry $g$ of a Euclidean building. We give a lower bound for $d_g(x)$ depending on the distance from $x$ to the minimal set of $g$.

Metric Geometry · Mathematics 2014-05-06 Carlos Ramos-Cuevas

We prove an equivariant version of the classical Menger-Nobeling theorem regarding topological embeddings: Whenever a group $G$ acts on a finite-dimensional compact metric space $X$, a generic continuous equivariant function from $X$ into…

Dynamical Systems · Mathematics 2024-07-03 Yonatan Gutman , Michael Levin , Tom Meyerovitch

A set $D \subseteq V$ of a graph $G=(V, E)$ is a dominating set of $G$ if each vertex $v\in V\setminus D$ is adjacent to at least one vertex in $D,$ whereas a set $D_2\subseteq V$ is a $2$-dominating (double dominating) set of $G$ if each…

Computational Complexity · Computer Science 2023-12-05 Soumyashree Rana , Sounaka Mishra , Bhawani Sankar Panda

Let $X$ be a partially ordered set with the property that each family of order intervals of the form $[a,b],[a,\rightarrow )$ with the finite intersection property has a nonempty intersection. We show that every directed subset of $X$ has a…

General Topology · Mathematics 2018-09-25 Rafael Espínola , Andrzej Wiśnicki

We study minimal idempotents $J^{\mathrm{min}}(X)$ in the Ellis semigroup $E(X)$ associated with a Floyd-Auslander system $(X,T)$. We show that $(X,T)$ is non-tame if and only if $|J^{\mathrm{min}}(X)| > 2^{\aleph_0}$, which happens exactly…

Dynamical Systems · Mathematics 2025-12-16 Gabriel Fuhrmann , Chunlin Liu

Let $H$ be a Krull monoid with finite class group $G$ such that every class contains a prime divisor. Then every non-unit $a \in H$ can be written as a finite product of atoms, say $a=u_1 \cdot \ldots \cdot u_k$. The set $\mathsf L (a)$ of…

Commutative Algebra · Mathematics 2016-10-19 Qinghai Zhong

Suppose $(X_n)$ is a sequence of positive-dimensional smooth projective complete intersections over $\mathbb{F}_q$ with dimensions bounded from above and with characteristic zero lifts $(\tilde{X}_n)$ to smooth projective geometrically…

Algebraic Geometry · Mathematics 2019-10-10 Masoud Zargar

Let $G$ be a connected, simply connected, simple, complex, linear algebraic group. Let $P$ be an arbitrary parabolic subgroup of $G$. Let $X=G/P$ be the $G$-homogeneous projective space attached to this situation. Let $d\in H_2(X)$ be a…

Algebraic Geometry · Mathematics 2017-06-21 Christoph Bärligea

In this article we study the structured distance to singularity for a nonsingular matrix $A\in\mathbb{C}^{n\times n}$, with a prescribed linear structure $\mathcal{S}$ (for instance, a sparsity pattern, or a real Toeplitz structure), i.e.,…

Numerical Analysis · Mathematics 2026-03-06 Miryam Gnazzo , Nicola Guglielmi , Federico Poloni , Stefano Sicilia

We give a detailed and easily accessible proof of Gromov's Topological Overlap Theorem. Let $X$ be a finite simplicial complex or, more generally, a finite polyhedral cell complex of dimension $d$. Informally, the theorem states that if $X$…

Geometric Topology · Mathematics 2016-09-20 Dominic Dotterrer , Tali Kaufman , Uli Wagner

Given a set $S$ of points in the plane, a geometric network for $S$ is a graph $G$ with vertex set $S$ and straight edges. We consider a broadcasting situation, where one point $r \in S$ is a designated source. Given a dilation factor…

Computational Geometry · Computer Science 2012-07-02 Otfried Cheong , Changryeol Lee

Let $(X,d)$ be a metric space. A set $S\subseteq X$ is said to be a $k$-metric generator for $X$ if and only if for any pair of different points $u,v\in X$, there exist at least $k$ points $w_1,w_2, \ldots w_k\in S$ such that $d(u,w_i)\ne…

Combinatorics · Mathematics 2016-07-06 A. Estrada-Moreno , I. G. Yero , J. A. Rodriguez-Velazquez