Related papers: Reconstructing compositions
The 3x+1 problem is one of the most classical problems in computer science, related to many fields. As it is thought by scientists a highly hard problem, resolving it successfully not only can improve the research in many relating fields,…
The Reconstruction Conjecture of Ulam asserts that, for $n\geq 3$, every $n$-vertex graph is determined by the multiset of its induced subgraphs with $n-1$ vertices. The conjecture is known to hold for various special classes of graphs but…
We prove the existence of a ternary sequence of factor complexity $2n+1$ for any given vector of rationally independent letter frequencies. Such sequences are constructed from an infinite product of two substitutions according to a…
We investigate compositions of a positive integer with a fixed number of parts, when there are several types of each natural number. These compositions produce new relationships among binomial coefficients, Catalan numbers, and numbers of…
A permutation is $k$-coverable if it can be partitioned into $k$ monotone subsequences. Barber conjectured that, for any given permutation, if every subsequence of length $k+2 \choose 2$ is $k$-coverable then the permutation itself is…
Let $\mathfrak{g}$ be a finite-dimensional simple complex Lie algebra. A layer sum is introduced as the sum of formal exponentials of the distinct weights appearing in an irreducible $\mathfrak{g}$-module. It is argued that the character of…
We prove that if S is a set of functions from a set A to itself, S is closed under composition, and S contains all transpositions of A, then the action of S on Acan be recovered from the semigroup consisting of S together with its…
The problem of reconstructing strings from substring information has found many applications due to its importance in genomic data sequencing and DNA- and polymer-based data storage. One practically important and challenging paradigm…
This paper concerns the reconstruction of possibly complex-valued coefficients in a second-order scalar elliptic equation posed on a bounded domain from knowledge of several solutions of that equation. We show that for a sufficiently large…
In 1960, W. Sierpinski proved that there are infinitely many positive odd numbers $k$, such that for any positive integer $n$, $k\times2^n+1$ is a composite number. Such numbers are called "Sierpinski numbers". In this study, by using…
We investigate the representations and the structure of Hecke algebras associated to certain finite complex reflection groups. We first describe computational methods for the construction of irreducible representations of these algebras,…
We give new positive results on the long-standing open problem of geometric covering decomposition for homothetic polygons. In particular, we prove that for any positive integer k, every finite set of points in R^3 can be colored with k…
We compute the decomposition of representations of Yangians into g-modules for simply-laced Lie algebras g. The decomposition has an interesting combinatorial tree structure. Results depend on a conjecture of Kirillov and Reshetikhin.
The graph reconstruction conjecture states that all graphs on at least three vertices are determined up to isomorphism by their deck. In this paper, a general framework for this problem is proposed to simply explain the reconstruction of…
We prove a Riemann-Hilbert correspondence for Ardakov-Wadsley's coadmissible D-cap-modules and, more generally, for Bode's $\mathcal{C}$-complexes. More precisely, we show that any given $\mathcal{C}$-complex can be reconstructed out of its…
We study the maximum multiplicity $\mathcal{M}(k,n)$ of a simple transposition $s_k=(k \: k+1)$ in a reduced word for the longest permutation $w_0=n \: n-1 \: \cdots \: 2 \: 1$, a problem closely related to much previous work on sorting…
Euler showed that the number of partitions of $n$ into distinct parts equals the number of partitions of $n$ into odd parts. This theorem was generalized by Glaisher and further by Franklin. Recently, Beck made three conjectures on…
Baryshnikov and Romik derived the combinatorial identities for the numbers of the $m$-strip tableaux. This generalized the classical Andr\'e's theorem for the number of up-down permutations. They asked for a bijective proof for the…
Let $n\geq 1$, $0\leq t\leq {n \choose 2}$ be arbitrary integers. Define the numbers $I_n(t)$ as the number of permutations of $[n]$ with $t$ inversions. Let $n,d\geq 1$ and $0\leq t\leq (d-1)n$ be arbitrary integers. Define {\em the…
A set is introreducible if it can be computed by every infinite subset of itself. Such a set can be thought of as coding information very robustly. We investigate introreducible sets and related notions. Our two main results are that the…