Related papers: On structure theorems and non-saturated examples

For a nilpotent group $G$, let $\Xi(G)$ be the difference between the complement of the generating graph of $G$ and the commuting graph of $G$, with vertices corresponding to central elements of $G$ removed. That is, $\Xi(G)$ has vertex set…

For a given d-minimal expansion $\mathfrak R$ of the ordered real field, we consider the expansion $\mathfrak R^\natural$ of $\mathfrak R$ generated by the sets of the form $\bigcup_{S \in \mathcal C}S$, where $\mathcal C$ is a subfamily of…

A minimal equicontinuous action of a group $G$ on a Stone space $X$ is called a subodometer. If such a subodometer arises from a group rotation, we refer to it as an odometer. For subodometers $(X,G)$ we show that the hyperspace…

Let $\Gamma$ denote a bipartite distance-regular graph with diameter $D \ge 4$ and valency $k \ge 3$. Let $X$ denote the vertex set of $\Gamma$, and let $A$ denote the adjacency matrix of $\Gamma$. For $x \in X$ let $T=T(x)$ denote the…

We study the quantization of the 6d Seiberg-Witten curve for D-type minimal conformal matter theories compactified on a two-torus. The quantized 6d curve turns out to be a difference equation established via introducing codimension two and…

Let $H$ be a Krull monoid with class group $G$. Then $H$ is factorial if and only if $G$ is trivial. Sets of lengths and sets of catenary degrees are well studied invariants describing the arithmetic of $H$ in the non-factorial case. In…

Given a finite regular graph G=(V,E) and a metric space (X,d_X), let $gamma_+(G,X) denote the smallest constant $\gamma_+>0$ such that for all f,g:V\to X we have: \frac{1}{|V|^2}\sum_{x,y\in V} d_X(f(x),g(y))^2\le \frac{\gamma_+}{|E|}…

The architecture of infinite structures with non-crystallographic symmetries can be modeled via aperiodic tilings, but a systematic construction method for finite structures with non-crystallographic symmetry at different radial levels is…

We study the dynamics of the map endomorphism of N-dimensional projective space defined by f(X)=AX^d, where A is a matrix and d is at least 2. When d>N^2+N+1, we show that the critical height of such a morphism is comparable to its height…

By building some suitable strictly ergodic models, we prove that for an ergodic system $(X,\mathcal{X},\mu, T)$, $d\in{\mathbb N}$, $f_1, \ldots, f_d \in L^{\infty}(\mu)$, the averages $$\frac{1}{N^2} \sum_{(n,m)\in [0,N-1]^2}…

We revisit the issue of low-distortion embedding of metric spaces into the line, and more generally, into the shortest path metric of trees, from the parameterized complexity perspective.Let $M=M(G)$ be the shortest path metric of an edge…

Let $G$ be a connected, simply connected nilpotent Lie group, identified with a real algebraic subgroup of $\mathrm{UT}(n,\mathbb{R})$, and let $\Gamma$ be a lattice in $G$, with $\pi:G\to G/\Gamma$ the quotient map. For a semi-algebraic…

For a ${\mathbb Z}^{d}$-topological dynamical system $(X, T, {\mathbb Z}^{d})$, an isomomorphism is a self-homeomorphism $\phi : X\to X$ such that for some matrix $M\in {\rm GL}(d,{\mathbb Z})$ and any ${n}\in {\mathbb Z}^{d}$, $\phi\circ…

In $d$-Scattered Set we are given an (edge-weighted) graph and are asked to select at least $k$ vertices, so that the distance between any pair is at least $d$, thus generalizing Independent Set. We provide upper and lower bounds on the…

Let $G$ be a weighted graph embedded in a metric space $(M, d_M )$. The vertices of $G$ correspond to the points in $M$ , with the weight of each edge $uv$ being the distance $d_M (u, v)$ between their respective points in $M$ . The…

Let $d, n \in \mathbb{Z}^+$ such that $1\leq d \leq n$. A $d$-code $\mathcal{C} \subset \mathbb{F}_q^{n \times n}$ is a subset of order $n$ square matrices with the property that for all pairs of distinct elements in $\mathcal{C}$, the rank…

Given a point set $P$ in the Euclidean space, a geometric $t$-spanner $G$ is a graph on $P$ such that for every pair of points, the shortest path in $G$ between those points is at most a factor $t$ longer than the Euclidean distance between…

We propose a nonadiabatic time-dependent spin-density functional theory (TDSDFT) approach for studying the single-electron excited states and the ultrafast response of systems with strong electron correlations. The correlations are…

We develop new approximation algorithms for classical graph and set problems in the RAM model under space constraints. As one of our main results, we devise an algorithm for d-Hitting Set that runs in time n^{O(d^2 + d/\epsilon})}, uses…

For a connected graph $G:=(V,E)$, the Steiner distance $d_G(X)$ among a set of vertices $X$ is the minimum size among all the connected subgraphs of $G$ whose vertex set contains $X$. The $k-$Steiner distance matrix $D_k(G)$ of $G$ is a…