Related papers: On Scottish Book Problem 157
Answering a question posed by Conway and Norton in their seminal 1979 paper on moonshine, we prove the existence of a graded infinite-dimensional module for the sporadic simple group of O'Nan, for which the McKay--Thompson series are weight…
In this book, the authors introduce the notion of Super linear algebra and super vector spaces using the definition of super matrices defined by Horst (1963). This book expects the readers to be well-versed in linear algebra. Many theorems…
Since the discovery of octonions in 1843 we seem to be still lacking a satisfactory if any theory of octave valued functions satisfactory according to standard requirements or expectation from the side of a theory like a one might look for.…
We develop an obstruction theory for the existence and uniqueness of a solution to the gluing problem for a destriction functor and apply it to some well-known biset functors. The obstruction groups for this theory are reduced cohomology…
Motivated by a historical combinatorial problem that resembles the well-known Josephus problem, we investigate circular partition algorithms and formulate problems in deterministic finite automata with practical algorithms. The historical…
We classify an algebraic phenomenon on certain families of wreath products that can be seen as coming from a family of puzzles about switches on the corners of a spinning table. Such puzzles have been written about and generalized since…
A classification, according to invariant theory, of non-constant invariant Abel ODEs known as solvable and found in the literature is presented. A set of new integrable classes depending on one or no parameters, derived from the analysis of…
We consider the problem of efficiently solving a system of $n$ non-linear equations in ${\mathbb R}^d$. Addressing Smale's 17th problem stated in 1998, we consider a setting whereby the $n$ equations are random homogeneous polynomials of…
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem is either contained in one out of six classes and can be solved in…
A significant group of problems coming from the realm of Combinatorial Geometry can only be approached through the use of Algebraic Topology. From the first such application to Kneser's problem in 1978 by Lov% \'{a}sz \cite{Lovasz} through…
We are interested in proving input-output properties of functions that handle infinite data such as streams or non-wellfounded trees. We provide a finitary refinement type system which is (sound and) complete for Scott-open properties…
We prove here that the polynomial <nabla(C_p(1)), e_a h_b h_c> q, t-enumerates, by the statistics dinv and area, the parking functions whose supporting Dyck path touches the main diagonal according to the composition p of size a + b + c and…
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…
In 1982 Macdonald published his now famous constant term conjectures for classical root systems. This paper begins with the almost trivial observation that Macdonald's constant term identities admit an extra set of free parameters, thereby…
Recently, Grynkiewicz et al. [{\it Israel J. Math.} {\bf 193} (2013), 359--398], using tools from additive combinatorics and group theory, proved necessary and sufficient conditions under which the linear congruence $a_1x_1+\cdots…
We provide a writeup of a resolution of Erd\H{o}s Problem #728; this is the first Erd\H{o}s problem (a problem proposed by Paul Erd\H{o}s which has been collected in the Erd\H{o}s Problems website) regarded as fully resolved autonomously by…
We provide completely effective error estimates for Stirling numbers of the first and second kind, denoted by $s(n,m)$ and $S(n,m)$, respectively. These bounds are useful for values of $m \geq n - O(\sqrt{n})$. An application of our Theorem…
The seminal paper "J.T. Stafford, Module structure of Weyl algebras, J. London Math. Soc. (2) 18 (1978), no. 3, 429--442" was a major step forward in our understanding of Weyl algebras. Beginning with Serre's Theorem on free summands of…
The doorways problem considers adjacent parallel hallways of unit width each with a single doorway (aligned with integer lattice points) of unit width. It then asks, what are the properties of lines that pass through each doorway?…
We consider the chessboard pebbling problem analyzed by Chung, Graham, Morrison and Odlyzko [3]. We study the number of reachable configurations $G(k)$ and a related double sequence $G(k,m)$. Exact expressions for these are derived, and we…