Related papers: Skew characters which contain only few components
We prove a lower bound on the number of the convex components of a compact set with non-empty interior in $\mathbb{R}^n$ for all $n\ge2$. Our result generalizes and improves the inequalities previously obtained in M. Carozza, F. Giannetti,…
We introduce two vertex operators to realize skew odd orthogonal characters $so_{\lambda/\mu}(x^{\pm})$ and derive the Cauchy identity for the skew characters via Toeplitz-Hankel-type determinant similar to the Schur functions. The method…
The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…
We prove that Sp\"ath's Character Triple Conjecture holds for every finite group with respect to maximal defect characters at the prime 2. This is done by reducing the maximal defect case of the conjecture to the so-called inductive…
This paper has been withdrawn due a crucial mistake due to a crucial mistake in the proof of Lemma 2.3.
The object of this short note is to prove a theorem and present a conjecture for the number of even entries in the character table of the symmetric group.
We prove that the ACC conjecture for minimal log discrepancies holds for threefolds in $[1-\delta,+\infty)$, where $\delta>0$ only depends on the coefficient set. We also study Reid's general elephant for pairs, and show Shokurov's…
The first two authors of this paper asserted in Lemma 4 of "New Farkas-type constraint qualifications in convex infinite programming" (DOI: 10.1051/cocv:2007027) that a given reverse convex inequality is consequence of a given convex system…
This paper has been withdrawn by the author. There is an error on page 3 in the last inequality before Lemma 1.1.
In this note, the correction to the proof of one theorem in some our previous paper [arXiv:1302.0589] will be given.
The authors of a recent paper [Phys. Rev. Lett. 113, 120404 (2014)] suggest that "weak values are not inherently quantum but rather a purely statistical feature of pre- and postselection with disturbance". We argue that this claim is…
We investigate a beautiful conjecture of T. Wilde on character values and element orders of finite groups. We reduce it to a statement on nearly simple groups that can be checked ``prime by prime". For these groups, we show that a strong…
Theorem 2 of A. Kercheval, "Denjoy minimal sets are far from affine", Ergodic Theory and Dynamical Systems 22 (2002), 1803-1812 is corrected by adding a C^2 bound to the hypotheses.
This paper has been withdrawn because of a gap in the proof of Lemma 3.10. The main reults in this paper have now been proved, and extended in the following papers: S. Ariki and A. Mathas, The number of simple modules of the Hecke algebras…
This is a corrected version of our paper published in Osaka Journal of Mathematics 51(2014), 673-693. We correct Theorem~1.1, Proposition~3.3 and their proofs.
The proof of Witten's finiteness conjecture established that the Kauffman bracket skein modules of closed $3$-manifolds are finitely generated over $\mathbb Q(A)$. In this paper, we develop a novel method for computing these skein modules.…
We prove combinatorial rules that give the minimal and maximal partitions labelling the irreducible constituents of a family of characters for the symmetric group that generalize Foulkes permutation characters. Restated in the language of…
An error is spotted in the statement of Theorem~1.3 of our published article titled "On oriented cliques with respect to push operation" (Discrete Applied Mathematics 2017). The theorem provided an exhaustive list of 16 minimal (up to…
In the article titled "Branching-Coalescing Particle Systems" published in Probability Theory and Related Fields 131(3), pages 376-414, (2005), Theorem 7 as stated there is incorrect. Indeed, we show by counterexample that the equality that…
We refine the reduction theorem of the McKay Conjecture proved by Isaacs, Malle and Navarro. Assuming the inductive McKay condition, we obtain a strong version of the McKay Conjecture that gives central isomorphic character triples.