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

We present a strong upper bound on the number k(B) of irreducible characters of a p-block B of a finite group G in terms of local invariants. More precisely, the bound depends on a chosen major B-subsection (u,b), its normalizer N_G(\langle…

In this paper, the class of random irregular block-hierarchical networks is defined and algorithms for generation and calculation of network properties are described. The algorithms presented for this class of networks are more efficient…

We formulate a property $P$ on a class of relations on the natural numbers, and formulate a general theorem on $P$, from which we get as corollaries the insolvability of Hilbert's tenth problem, G\"odel's incompleteness theorem, and…

Let G be a connected reductive group defined over an algebraically closed field k of characteristic p > 0. The purpose of this paper is two-fold. First, when p is a good prime, we give a new proof of the ``order formula'' of D. Testerman…

We study a weakened version of the Holm--Willems Local Conjecture. The problem is reduced to quasi-simple groups under the assumption that the defect group is abelian. Complete proofs are provided in the case \(p = 2\).

In recent work by Johnson et al. (2022), a framework was described for the study of graph problems over classes specified by omitting each of a finite set of graphs as subgraphs. If a problem falls into the framework then its computational…

This paper is a contribution to the problem of particle localization in non-relativistic Quantum Mechanics. Our main results will be (1) to formulate the problem of localization in terms of invariant subspaces of the Hilbert space, and (2)…

We develop an operator-theoretic framework for stability and statistical concentration in nonlinear inverse problems with block-structured parameters. Under a unified set of assumptions combining blockwise Lipschitz geometry, local…

Higher-order regularization problem formulations are popular frameworks used in machine learning, inverse problems and image/signal processing. In this paper, we consider the computational problem of finding the minimizer of the Sobolev…

Let $G$ be a finite group with Sylow $2$-subgroup $P \leqslant G$. Navarro-Tiep-Vallejo have conjectured that the principal $2$-block of $N_G(P)$ contains exactly one irreducible Brauer character if and only if all odd-degree ordinary…

In this paper, we show that the Alperin-McKay conjecture holds for 2-blocks of maximal defect. A major step in the proof is the verification of the inductive Alperin-McKay condition for the principal 2-block of groups of Lie type in odd…

In this paper we use the Galois module structure for the classical parameterizing spaces for elementary p-abelian extensions of a field K to give necessary and sufficient conditions for the solvability of any embedding problem which is an…

We study the Steiner Tree problem on the intersection graph of most natural families of geometric objects, e.g., disks, squares, polygons, etc. Given a set of $n$ objects in the plane and a subset $T$ of $t$ terminal objects, the task is to…

In a graph bisection problem, we are given a graph $G$ with two equally-sized unlabeled communities, and the goal is to recover the vertices in these communities. A popular heuristic, known as spectral clustering, is to output an estimated…

We study central simple algebras in various ways, focusing on the role of $p$-central subspaces. The first part of my thesis is dedicated to the study of Clifford algebras. The standard Clifford algebra of a given form is the generic…

This paper is concerned with a study of the classical isoperimetric problem modified by an addition of a non-local repulsive term. We characterize existence, non-existence and radial symmetry of the minimizers as a function of mass in the…

In this paper we prove that a recent condition of Lyons--Mart\'inez--Navarro--Tiep, regarding the field of values of extensions of characters in principal blocks, is satisfied for all finite simple groups, which when combined with their…

It is well-known that the graph isomorphism problem can be posed as an equivalent problem of determining whether an auxiliary graph structure contains a clique of specific order. However, the algorithms that have been developed so far for…

We show that if the principal p-block of a finite group G contains exactly 5 irreducible ordinary characters, then a Sylow p-subgroup of G has order 5, 7 or is isomorphic to one of the non-abelian 2-groups of order 8.

For a given set of intervals on the real line, we consider the problem of ordering the intervals with the goal of minimizing an objective function that depends on the exposed interval pieces (that is, the pieces that are not covered by…