This text, accompanied by a ‘gospel’ that I made by montaging the US-recorded captions, is an attempt for re-narrating Marshall Plan’s discourse on the working class, aka the so-called ‘free labor’ of the US against the ‘communist labor’ of the “Soviet thr ...
We present a quasilinear time algorithm to decide the word problem on a natural algebraic structures we call orthocomplemented bisemilattices, a subtheory of boolean algebra. We use as a base a variation of Hopcroft, Ullman and Aho algorithm for tree isomo ...
We consider fundamental algorithmic number theoretic problems and their relation to a class of block structured Integer Linear Programs (ILPs) called 2-stage stochastic. A 2-stage stochastic ILP is an integer program of the form min{c(T)x vertical bar Ax = ...
We propose a new approach for normalization and simplification of logical formulas. Our approach is based on algorithms for lattice-like structures. Specifically, we present two efficient algorithms for computing a normal form and deciding the word problem ...
Stochastic gradient descent (SGD) and randomized coordinate descent (RCD) are two of the workhorses for training modern automated decision systems. Intriguingly, convergence properties of these methods are not well-established as we move away from the spec ...
This paper considers a fundamental class of convex matrix optimization problems with low-rank solutions. We show it is possible to solve these problem using far less memory than the natural size of the decision variable when the problem data has a concise ...
In computability theory a variety of combinatorial systems are encountered (word problems, production systems) that exhibit undecidability properties. Here we seek such structures in the realm of Analysis, more specifically in the area of Fourier Analysis. ...
Let G be a finite group and R be a commutative ring. The Mackey algebra μR(G) shares a lot of properties with the group algebra RG however, there are some differences. For example, the group algebra is a symmetric algebra and this is not always the case fo ...
In this thesis, we present new approximation algorithms as well as hardness of approximation results for NP-hard vehicle routing problems related to public transportation. We consider two different problem classes that also occur frequently in areas such a ...
We determine the torsion subgroup of the group of endotrivial modules for a finite solvable group in characteristic p. We also prove that our result would hold for p-solvable groups, provided a conjecture can be proved about the case of p-nilpotent groups. ...
All the results in this work concern (finite) p-groups. Chapter 1 is concerned with classifications of some classes of p-groups of class 2 and there are no particularly new results in this chapter, which serves more as an introductory chapter. The "geometr ...
We establish a connection between Dixmier's unitarisability problem and the expected degree of random forests on a group. As a consequence, a residually finite group is non-unitarisable if its first L2-Betti number is non-zero or if it is finitely generate ...
φ For all finite n ∈ N, there is a well-known isomorphism between the standard braid group Bn and the mapping class group π0Hn. This isomorphism has been exhaustively studied in literature, and generalized in many ways. For some basic topological reason, t ...
We revisit the well-known group membership problem and show how it can be considered a special case of a simple problem, the set membership problem. In the set membership problem, processes maintain a set whose elements are drawn from an arbitrary universe ...
This dissertation is concerned with the study of a new family of representations of finite groups, the endo-p-permutation modules. Given a prime number p, a finite group G of order divisible by p and an algebraically closed field k of characteristic p, we ...
