Related papers: On the Subgroup Distance Problem in Cyclic Permuta…
SDE driven by an $\alpha $-stable process, $\alpha \in \lbrack 1,2),$ with Lipshitz continuous coefficient and $\beta $-H\"older drift is considered. The existence and uniqueness of a strong solution is proved when $\beta >1-\alpha /2$ by…
In the well-known complexity class NP are combinatorial problems, whose optimization counterparts are important for many practical settings. These problems typically consider full knowledge about the input. In practical settings, however,…
A finite set $X$ in the $d$-dimensional Euclidean space is called an $s$-distance set if the set of distances between any two distinct points of $X$ has size $s$. In 1977, Larman-Rogers-Seidel proved that if the cardinality of an…
The HarishChandra-Itzykson-Zuber integral over the unitary group U(k) (beta=2) is present in numerous problems involving Hermitian random matrices. It is well known that the result is semi-classically exact. This simple result does not…
Diaconis and Graham studied a measure of distance from the identity in the symmetric group called total displacement and showed that it is bounded below by the sum of length and reflection length. They asked for a characterization of the…
We prove that, for any closed semialgebraic subset $W$ of $\mathbb{R}^n$ and for any positive integer $p$, there exists a Nash function $f:\mathbb{R}^n\setminus W\longrightarrow (0, \infty)$ which is equivalent to the distance function from…
We prove that the commutator is stable in permutations endowed with the Hamming distance, that is, two permutations that almost commute are near two commuting permutations. Our result extends to $k$-tuples of almost commuting permutations,…
We prove results on the decidability and complexity of computing the total variation distance (equivalently, the $L_1$-distance) of hidden Markov models (equivalently, labelled Markov chains). This distance measures the difference between…
In this paper we define and investigate a class of groups characterized by a representation-theoretic property we call purely noncommuting or PNC. This property guarantees that the group has an action on a smooth projective variety with…
Let $G$ be a finite group, $L_1(G)$ be its poset of cyclic subgroups and consider the quantity $\alpha(G)=\frac{|L_1(G)|}{|G|}$. The aim of this paper is to study the class $\cal{C}$ of finite nilpotent groups having…
Given a finite group $G$, we introduce the \textit{permutability degree} of $G$, as $$pd(G)=\frac{1}{|G| \ |\mathcal{L}(G)|} {\underset{X \in \mathcal{L}(G)}\sum}|P_G(X)|,$$ where $\mathcal{L}(G)$ is the subgroup lattice of $G$ and $P_G(X)$…
This paper investigates how the geometry of a cycle in the loop space of a Riemannian manifold controls its topology. For fixed $\beta \in H^n(\Omega X; \mathbb{R})$ one can ask how large $|\langle \beta, Z \rangle|$ can be for cycles $Z$…
A variety of behaviors of entropy functions of random walks on finitely generated groups is presented, showing that for any $\frac{1}{2}\leq \alpha\leq\beta\leq1$, there is a group $\Gamma$ with measure $\mu$ equidistributed on a finite…
The commutator length $cl_G(g)$ of an element $g \in [G,G]$ in the commutator subgroup of a group $G$ is the least number of commutators needed to express $g$ as their product. If $G$ is a non-abelian free groups, then given an integer $n…
Labelled Markov chains (LMCs) are widely used in probabilistic verification, speech recognition, computational biology, and many other fields. Checking two LMCs for equivalence is a classical problem subject to extensive studies, while the…
The $k$-mismatch problem consists in computing the Hamming distance between a pattern $P$ of length $m$ and every length-$m$ substring of a text $T$ of length $n$, if this distance is no more than $k$. In many real-world applications, any…
We obtain estimates exact in order for deviations of Zygmund sums in metrics of spaces $L_{q}$, $1<q<\infty$, on classes of $2\pi$-periodic functions, that admit the representation in the form of convolution of functions that belong to unit…
We begin an investigation of supersymmetric theories based on exceptional groups. The flat directions are most easily parameterized using their correspondence with gauge invariant polynomials. Symmetries and holomorphy tightly constrain the…
Let $X$ be an $n$--element finite set, $0<k\leq n/2$ an integer. Suppose that $\{A_1,A_2\} $ and $\{B_1,B_2\} $ are pairs of disjoint $k$-element subsets of $X$ (that is, $|A_1|=|A_2|=|B_1|=|B_2|=k$, $A_1\cap A_2=\emptyset$, $B_1\cap…
We study patch solutions of a family of transport equations given by a parameter $\alpha$, $0< \alpha <2$, with the cases $\alpha =0$ and $\alpha =1$ corresponding to the Euler and the surface quasi-geostrophic equations respectively. In…