Related papers: On the Subgroup Distance Problem in Cyclic Permuta…

We show that Nachman's integral equations for the Calder\'on problem, derived for conductivities in $W^{2,p}(\Omega)$, still hold for $L^\infty$ conductivities which are $1$ in a neighborhood of the boundary. We also prove convergence of…

This paper investigates the behaviour of rotating binaries. A rotation by $r$ digits to the left of a binary number $B$ exhibits in particular cases the divisibility $l\mid N_1(B)\cdot r+1$, where $l$ is the bit-length of $B$ and $N_1(B)$…

We consider the problem of finding a Hamiltonian path or a Hamiltonian cycle with precedence constraints in the form of a partial order on the vertex set. We show that the path problem is $\mathsf{NP}$-complete for graphs of pathwidth 4…

We show that for a fixed integer $n \neq \pm2$, the congruence $x^2 + nx \pm 1 \equiv 0 \pmod{\alpha}$ has the solution $\beta$ with $0 < \beta < \alpha$ if and only if $\alpha/\beta$ has a continued fraction expansion with sequence of…

In a previous paper, the author (together with Matthew Emerton) proved that the completed cohomology groups of SL_N(Z) are stable in fixed degree as N goes to infinity (Z may be replaced by the ring O_F of integers of any number field). In…

Let $G$ be a countable group and $k$ a positive integer, we show that the $L^2$-Betti numbers of the group $G$ vanish up to degree $k$ provided that there is some infinite index subgroup $H$ with finite $k$th $L^2$-Betti number containing a…

We study how the order of N independent random walks in one dimension evolves with time. Our focus is statistical properties of the inversion number m, defined as the number of pairs that are out of sort with respect to the initial…

The H-type deviation, $\delta({\mathbb G})$, of a step two Carnot group ${\mathbb G}$ quantifies the extent to which ${\mathbb G}$ deviates from the geometrically and algebraically tractable class of Heisenberg-type (H-type) groups. In an…

The subgroup commutativity degree of a group G has been defined in [6] as the probability that two subgroups of G commute, or equivalently that the product of two subgroups is again a subgroup. Problem 4.3 of [6] asks whether there exist…

Polycyclic codes offer a natural generalization of cyclic codes and provide a broader algebraic framework for constructing linear codes with good parameters. In this paper, we study binary polycyclic codes associated with powers of…

We consider the stable norm associated to a discrete, torsionless abelian group of isometries $\Gamma \cong \mathbb{Z}^n$ of a geodesic space $(X,d)$. We show that the difference between the stable norm $\| \;\, \|_{st}$ and the distance…

We establish a stability result for the Shannon-McMillan-Breiman theorem on the one-sided finite shift space. For any shift-invariant probability measure P and any data-dependent parsing whose number of blocks is sublinear in N almost…

Given a set $I \subseteq \mathbb{N}$, consider the sequences $\{d_n(I)\},\{p_n(I)\}$ where for any $n$, $d_n(I)$ and $p_n(I)$ respectively count the number of permutations in the symmetric group $\mathfrak{S}_n$ whose descent set…

We prove a necessary and sufficient condition for a principal shift invariant space of $L^2(\mathbb{R})$ to be invariant under translations by the subgroup $\frac{1}{N} \mathbb{Z}, N>1$. This condition is given in terms of the Zak transform…

For any $\beta > 1$, let $T_\beta: [0,1)\rightarrow [0,1)$ be the $\beta$-transformation defined by $T_\beta x=\beta x \mod 1$. We study the uniform recurrence properties of the orbit of a point under the $\beta$-transformation to the point…

Let $C_n$ be the cyclic group of order $n$. In this paper, we provide the exact values of some zero-sum constants over $C_n \rtimes_s C_2$ where $s \not\equiv \pm1 \pmod n$, namely $\eta$-constant, Gao constant, and Erd\H{o}s-Ginzburg-Ziv…

In this paper we examine the discrete Shnirelman's inequality [Shnirelman A., 1985], which relates the $L^2$-distance of two discrete configurations of a fluid to the $L^1_tL^2_x$-norm of the vector field connecting them. Our proof is…

Let $A$ be a set of natural numbers and let $S_{n,A}$ be the set of all permutations of $[n]=\{1,2,...,n\}$ with cycle lengths belonging to $A$. For $A(n)=A\cap [n]$, the limit $\rho=\lim_{n\to\infty}\mid A(n)\mid/n$ (if it esists) is…

Recently, $p$-presentation distances for $p\in [1,\infty]$ were introduced for merge trees and multiparameter persistence modules as more sensitive variations of the respective interleaving distances ($p=\infty)$. It is well-known that…

We consider the problem of finding a Hamiltonian path or cycle with precedence constraints in the form of a partial order on the vertex set. We study the complexity for graph width parameters for which the ordinary problems…