The number of set-orbits of a solvable permutation group

A permutation group 𝐺 acting on a set Ω induces a permutation action on the power set P ⁢ ( Ω ) \mathscr{P}(\Omega) (the set of all subsets of Ω). Let 𝐺 be a finite permutation group of degree 𝑛, and let s ⁢ ( G ) s(G) denote the number of orbits of 𝐺 on P ⁢ ( Ω ) \mathscr{P}(\Omega) . In this paper, we give the explicit lower bound of log 2 ⁡ s ⁢ ( G ) / log 2 ⁡ | G | \log_{2}s(G)/{\log_{2}\lvert G\rvert} over all solvable groups 𝐺. As applications, we first give an explicit bound of a result of Keller for estimating the number of conjugacy classes, and then we combine it with the McKay conjecture to estimate the number of p ′ p^{\prime} -degree irreducible representations of a solvable group.

On Proinov’s Lower Bound for the Diaphony

In 1986, Proinov published an explicit lower bound for the diaphony of finite and infinite sequences of points contained in the d−dimensional unit cube [Proinov, P. D.:On irregularities of distribution, C. R. Acad. Bulgare Sci. 39 (1986), no. 9, 31–34]. However, his widely cited paper does not contain the proof of this result but simply states that this will appear elsewhere. To the best of our knowledge, this proof was so far only available in a monograph of Proinov written in Bulgarian [Proinov, P. D.: Quantitative Theory of Uniform Distribution and Integral Approximation, University of Plovdiv, Bulgaria (2000)]. The first contribution of our paper is to give a self contained version of Proinov’s proof in English. Along the way, we improve the explicit asymptotic constants implementing recent, and corrected results of [Hinrichs, A.—Markhasin, L.: On lower bounds for the ℒ2-discrepancy, J. Complexity 27 (2011), 127–132.] and [Hinrichs, A.—Larcher, G.: An improved lower bound for the ℒ2-discrepancy, J. Complexity 34 (2016), 68–77]. (The corrections are due to a note in [Hinrichs, A.—Larcher, G. An improved lower bound for the ℒ2-discrepancy, J. Complexity 34 (2016), 68–77].) Finally, as a main result, we use the method of Proinov to derive an explicit lower bound for the dyadic diaphony of finite and infinite sequences in a similar fashion.

On Growth of the Set $A(A+1)$ in Arbitrary Finite Fields

Let $\mathbb{F}_q$ be a finite field of order $q$, where $q$ is a power of a prime. For a set $A \subset \mathbb{F}_q$, under certain structural restrictions, we prove a new explicit lower bound on the size of the product set $A(A + 1)$. Our result improves on the previous best known bound due to Zhelezov and holds under more relaxed restrictions.

Lower Bound for the Class Number of ℚn2+4

In this paper, we give an explicit lower bound for the class number of real quadratic field ℚd, where d=n2+4 is a square-free integer, using ωn which is the number of odd prime divisors of n.

The critical radius in sampling-based motion planning

We develop a new analysis of sampling-based motion planning in Euclidean space with uniform random sampling, which significantly improves upon the celebrated result of Karaman and Frazzoli and subsequent work. In particular, we prove the existence of a critical connection radius proportional to [Formula: see text] for n samples and d dimensions: below this value the planner is guaranteed to fail (similarly shown by Karaman and Frazzoli). More importantly, for larger radius values the planner is asymptotically (near-)optimal. Furthermore, our analysis yields an explicit lower bound of [Formula: see text] on the probability of success. A practical implication of our work is that asymptotic (near-)optimality is achieved when each sample is connected to only [Formula: see text] neighbors. This is in stark contrast to previous work that requires [Formula: see text] connections, which are induced by a radius of order [Formula: see text]. Our analysis applies to the probabilistic roadmap method (PRM), as well as a variety of “PRM-based” planners, including RRG, FMT*, and BTT. Continuum percolation plays an important role in our proofs. Lastly, we develop similar theory for all the aforementioned planners when constructed with deterministic samples, which are then sparsified in a randomized fashion. We believe that this new model, and its analysis, is interesting in its own right.

Exponential Strong Converse for One Helper Source Coding Problem

We consider the one helper source coding problem posed and investigated by Ahlswede, Körner and Wyner. Two correlated sources are separately encoded and are sent to a destination where the decoder wishes to decode one of the two sources with an arbitrary small error probability of decoding. In this system, the error probability of decoding goes to one as the source block length n goes to infinity. This implies that we have a strong converse theorem for the one helper source coding problem. In this paper, we provide the much stronger version of this strong converse theorem for the one helper source coding problem. We prove that the error probability of decoding tends to one exponentially and derive an explicit lower bound of this exponent function.