Related papers: The solution of the complete nontrivial cycle inte…

We give a proof of the uniform convergence of Fourier series, using the methods of nonstandard analysis.

For any simple digraph $D$ we offer a new proof for the intersection number of its middle digraph, $M(D)$; while doing so we also solve for the intersection number when $D$ has loops. In addition, a new transformation, the union of $D$ and…

Any permutation has a disjoint cycle decomposition and concept generates an equivalence class on the symmetry group called the cycle-type. The main focus of this work is on permutations of restricted cycle-types, with particular emphasis on…

In this paper we consider permutations of sequences of partitions, obtaining a result which parallels von Neumann's theorem on permutations of dense sequences and uniformly distributed sequences of points.

We prove that the automorphism group of a general complete intersection $X$ in a projective space is trivial with a few well-understood exceptions. We also prove that the automorphism group of a complete intersection $X$ acts on the…

We present a new approach to proving non-termination of non-deterministic integer programs. Our technique is rather simple but efficient. It relies on a purely syntactic reversal of the program's transition system followed by a…

In this article, we study a model of random permutations, which we call random standardized permutations, based on a sequence of i.i.d. random variables. This model generalizes others, such as the riffle-shuffle and the major-index-biased…

We give a proof of the Acyclicity Conjecture stated by Broussous and Schneider in [BrouSch2017]. As a consequence, we obtain an exact resolution of every admissible representation on each Bernstein block of ${\rm GL}(N)$ associated to a…

We prove that in an arbitrary semigroup without cycles, the problem of divisibility and, therefore, the word problem is solvable.

In this paper, we describe the structure of maximal non-trivial uniform $t$-intersecting families with large size for finite sets. In the special case when $t=1$, our result gives rise to Kostochka and Mubayi's result in 2017.

In this work we study permutation synchronisation for the challenging case of partial permutations, which plays an important role for the problem of matching multiple objects (e.g. images or shapes). The term synchronisation refers to the…

We prove the precise inversion of adjunction formula for finite linear group quotients of complete intersection varieties defined by semi-invariant equations. As an application, we prove the semi-continuity of minimal log discrepancies for…

We find exact and asymptotic formulas for the number of pairs $(p,q)$ of $N$-cycles such that the all cycles of the product $p\cdot q$ have lengths from a given integer set. We then apply these results to prove a surprisingly high lower…

For suitable subgroups of a finitely generated group, we define the intersection number of one subgroup with another subgroup and show that this number is symmetric. We also give an interpretation of this number.

The purpose of this note is to give an affirmative answer to a conjecture appearing in [Integral Transforms Spec. Funct. 26 (2015) 90-95].

We design a perfect zero-knowledge proof system for recognition if two permutation groups are conjugate.

In this paper we produce infinitely many examples of set-theoretic complete intersection monomial curves in $\mathbb{P}^{n+1}$, starting with a set-theoretic complete intersection monomial curve in $\mathbb{P}^{n}$ . In most of the cases…

We consider the cycle structure of a random permutation $\sigma$ chosen uniformly from the symmetric group, subject to the constraint that $\sigma$ does not contain cycles of length exceeding $r.$ We prove that under suitable conditions the…

We establish the exact overlaps conjecture for iterated functions systems on the real line with algebraic contractions and arbitrary translations.

Let $T$ be a tree on $n$ vertices. We can regard the edges of $T$ as transpositions of the vertex set; their product (in any order) is a cyclic permutation. All possible cyclic permutations arise (each exactly once) if and only if the tree…