Related papers: The Main Problem of Block Theory: Picky Elements a…

The longstanding Alperin weight conjecture and its blockwise version have been reduced to simple groups recently by Navarro, Tiep, Spaeth and Koshitani. Thus, to prove this conjecture, it suffices to verify the corresponding inductive…

It has been observed in many places that constant-factor approximable problems often admit polynomial or even linear problem kernels for their decision versions, e.g., Vertex Cover, Feedback Vertex Set, and Triangle Packing. While there…

For a prime $p$, we determine a Sylow $p$-subgroup $D$ of a finite group $G$ such that the principal $p$-block $B$ of $G$ has four irreducible ordinary characters. It has been determined already for the cases where the number is up to three…

In this paper, we study some variations of the well-known It\^{o}-Michler theorem for $p$-Brauer characters using various inequalities involving the $p$-Brauer character degrees of finite groups. Several new criteria for the existence of a…

Representation theory of finite groups portrays a marvelous crossroad of group theory, algebraic combinatorics, and probability. In particular the Plancherel measure is a probability that arises naturally from representation theory, and in…

We consider the $\Pi$-free Deletion problem parameterized by the size of a vertex cover, for a range of graph properties $\Pi$. Given an input graph $G$, this problem asks whether there is a subset of at most $k$ vertices whose removal…

Two widely-used computational paradigms for sublinear algorithms are using linear measurements to perform computations on a high dimensional input and using structured queries to access a massive input. Typically, algorithms in the former…

In representation theory of finite groups an important role is played by irreducible characters of p-defect 0, for a prime p dividing the group order. These are exactly those vanishing at the p-singular elements. In this paper we generalize…

We discuss some recent developments in the theory of free boundary problems, as obtained in a series of papers in collaboration with L. Caffarelli, A. Karakhanyan and O. Savin. The main feature of these new free boundary problems is that…

We consider the local properties problem for difference sets: we define $g(n, k, \ell)$ to be the minimum value of $\lvert A - A\rvert$ over all $n$-element sets $A \subseteq \mathbb{R}$ with the `local property' that $\lvert A' - A'\rvert…

We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…

We give a selection of major open problems involving selective properties, diagonalizations, and covering properties for sets of real numbers. This is a revision of the version published as a chapter in the book \textbf{Open Problems in…

This manuscript represents the author's PhD dissertation thesis.The first part studies decision problems in Thompson's groups F,T,V and some generalizations. The simultaneous conjugacy problem is determined to be solvable for Thompson's…

Despite significant recent advances in the regularity theory for obstacle problems with integro-differential operators, some fundamental questions remained open. On the one hand, there was a lack of understanding of parabolic problems with…

This paper is a continuation of [GLT], which develops a level theory and establishes strong character bounds for finite simple groups of linear and unitary type in the case that the centralizer of the element has small order compared to…

Principal Component Analysis (PCA) is a powerful tool in statistics and machine learning. While existing study of PCA focuses on the recovery of principal components and their associated eigenvalues, there are few precise characterizations…

Let $B$ be a $p$-block of a finite group $G$ with defect group $D$. The more difficult direction of the recently proven height zero conjecture says that $D$ is abelian if every character in Irr$(B)$ has height zero. We consider a smaller…

A design is additive under an abelian group $G$ (briefly, $G$-additive) if, up to isomorphism, its point set is contained in $G$ and the elements of each block sum up to zero. The only known Steiner 2-designs that are $G$-additive for some…

We compare lower defect groups associated with $p$-regular classes and vertices of simple modules for a block of a finite group algebra. We show that lower defect groups are contained in vertices of simple modules after suitable reordering.…

Kernelization---a mathematical key concept for provably effective polynomial-time preprocessing of NP-hard problems---plays a central role in parameterized complexity and has triggered an extensive line of research. This is in part due to a…