Related papers: One-dimensional quasi-uniform Kronecker sequences

The Kolakoski sequence is the unique infinite sequence with values in $\{1,2\}$ and first term $1$ which equals the sequence of run-lengths of itself, we call this $K(1,2).$ We define $K(m,n)$ similarly. A well-known conjecture is that the…

Suppose that $E \subset \mathbb{R}^{n+1}$ is a uniformly rectifiable set of codimension $1$. We show that every harmonic function is $\varepsilon$-approximable in $L^p(\Omega)$ for every $p \in (1,\infty)$, where $\Omega := \mathbb{R}^{n+1}…

We prove a Hardy inequality on convex sets, for fractional Sobolev-Slobodecki\u{\i} spaces of order $(s,p)$. The proof is based on the fact that in a convex set the distance from the boundary is a superharmonic function, in a suitable…

It has been conjectured by W. Chen that the distribution of the length of the longest increasing subsequence in a uniformly random permutation is log-concave. We propose a stronger version of this conjecture which involves the Kronecker…

In this article, we study the quasi-homogeneity of a superpotential in a complete free algebra over an algebraic closed field of characteristic zero. We prove that a superpotential with finite dimensional Jacobi algebra is right equivalent…

The main inspiration for this paper is a paper by Elek where he introduces combinatorial cost for graph sequences. We show that having cost equal to 1 and hyperfiniteness are coarse invariants. We also show `cost-1' for box spaces behaves…

Let T be a complete, first-order theory in a finite or countable language having infinite models. Let I(T,kappa) be the number of isomorphism types of models of T of cardinality \kappa. We denote by \mu (respectively \hat\mu) the number of…

We consider a $C^{1,\alpha}$ smooth flow in $\mathbb{R}^n$ which is "strongly monotone" with respect to a cone $C$ of rank $k$, a closed set that contains a linear subspace of dimension $k$ and no linear subspaces of higher dimension. We…

A theorem of Kaplansky asserts that a semigroup of matrices with entries from a field whose members all have singleton spectra is triangularizable. Indeed, Kaplansky's Theorem unifies well-known theorems of Kolchin and Levitzki on…

We introduce a new variant of quantitative Helly-type theorems: the minimal \emph{"homothetic distance"} of the intersection of a family of convex sets to the intersection of a subfamily of a fixed size. As an application, we establish the…

We study moduli spaces of (semi-)stable representations of one-point extensions of quivers by rigid representations. This class of moduli spaces unifies Grassmannians of subrepresentations of rigid representations and moduli spaces of…

In the present work a new simple proof of the theorem of Gallagher about the average of the singular series in the Hardy-Littlewood prime k-tuple conjecture is proved (in an even stronger form) which is uniform with respect to k (if the…

In this paper we establish a direct connection between stable approximate unitary equivalence for $*$-homomorphisms and the topology of the KK-groups which avoids entirely C*-algebra extension theory and does not require nuclearity…

In 1999, Katona and Kierstead conjectured that if a $k$-uniform hypergraph $\cal H$ on $n$ vertices has minimum co-degree $\lfloor \frac{n-k+3}{2}\rfloor$, i.e., each set of $k-1$ vertices is contained in at least $\lfloor…

In this paper, we make significant progress on a conjecture proposed by Dan Archdeacon on the existence of integer Heffter arrays $H(m,n;s,k)$ whenever the necessary conditions hold, that is, $3\leqslant s \leqslant n$, $3\leqslant…

We study the representation theory of the infinite type A Hecke algebra over a non-archimedean field in the case where the parameter is a pseudo-uniformizer. Specifically, we consider a family of representations, called almost-symmetric,…

We provide counter-examples to Mulmuley's strong saturation conjecture (strong SH) for the Kronecker coefficients. This conjecture was proposed in the setting of Geometric Complexity Theory to show that deciding whether or not a Kronecker…

A bound on consecutive clique numbers of graphs is established. This bound is evaluated and shown to often be much better than the bound of the Kruskal-Katona theorem. A bound on non-consecutive clique numbers is also proven.

We consider a generalized Cantor set $E(\omega)$ for an infinite sequence $\omega=(q_n)_{n=1}^{\infty}$ of positive numbers with $0<q_n<1$, and examine the quasiconformal equivalence to the standard middle one-third Cantor set…

We settle the question of where exactly the reduced Kronecker coefficients lie on the spectrum between the Littlewood-Richardson and Kronecker coefficients by showing that every Kronecker coefficient of the symmetric group is equal to a…