Related papers: Constructive Membership Tests in Some Infinite Mat…
A quasi-automatic semigroup is defined by a finite set of generators, a rational (regular) set of representatives, such that if a is a generator or neutral, then the graph of right multiplication by a on the set of representatives is a…
The ability to generate test data is often a necessary prerequisite for automated software testing. For the generated data to be fit for its intended purpose, the data usually has to satisfy various logical constraints. When testing is…
Probabilistic algorithms are applied to prove theorems about the finite general linear and unitary groups which are typically proved by techniques such as character theory and Moebius inversion. Among the theorems studied are Steinberg's…
We describe a curious structure of the special orthogonal, special unitary, and symplectic groups that has not been observed, namely, they can be expressed as matrix products of their corresponding Grassmannians realized as involution…
A range of applications for automatic machine learning need the generation process to be controllable. In this work, we propose a way to control the output via a sequence of simple actions, that are called semantic code classes. Finally, we…
Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about other programming languages inside type theory. It is…
We study the problem of combining the outcomes of several different classifiers in a way that provides a coherent inference that satisfies some constraints. In particular, we develop two general approaches for an important…
In this paper, we give strong lower bounds on the size of the sets of products of matrices in some certain groups. More precisely, we prove an analogue of a result due to Chapman and Iosevich for matrices in $SL_2(\mathbb{F}_p)$ with…
Explainable machine learning methods have been accompanied by substantial development. Despite their success, the existing approaches focus more on the general framework with no prior domain expertise. High-stakes financial sectors have…
Oftentimes the elements of a ring or semigroup $H$ can be written as finite products of irreducible elements, say $a=u_1 \cdot \ldots \cdot u_k = v_1 \cdot \ldots \cdot v_{\ell}$, where the number of irreducible factors is distinct. The set…
In nonadaptive group testing, the main research objective is to design an efficient algorithm to identify a set of up to $t$ positive elements among $n$ samples with as few tests as possible. Disjunct matrices and separable matrices are two…
We describe certain special consequences of certain elementary methods from group theory for studying the algebraic complexity of matrix multiplication, as developed by H. Cohn, C. Umans et. al. in 2003 and 2005. The measure of complexity…
In this work we provide an elementary derivation of the indefinite spin groups in low-dimensions. Our approach relies on the isomorphism of Cl(p+1, q+1) to the algebra 2x2 matrices with entries in Cl(p,q), simple properties of Kronecker…
In this paper, we study the possibility of designing non-trivial random CSP models by exploiting the intrinsic connection between structures and typical-case hardness. We show that constraint consistency, a notion that has been developed to…
For $n > 2$, let $\Gamma$ denote either $SL(n, Z)$ or $Sp(n, Z)$. We give a practical algorithm to compute the level of the maximal principal congruence subgroup in an arithmetic group $H\leq \Gamma$. This forms the main component of our…
A subset of a group invariably generates the group if it generates even when we replace the elements by any of their conjugates. In a 2016 paper, Pemantle, Peres and Rivin show that the probability that four randomly selected elements…
In this text we develop the formalism of products and powers of linear codes under componentwise multiplication. As an expanded version of the author's talk at AGCT-14, focus is put mostly on basic properties and descriptive statements that…
We give an easily checkable algebraic condition which implies that two elements of a finitely generated free group are members of distinct doubly-twisted conjugacy classes with respect to a pair of homomorphisms. We further show that this…
Let $\mathbb{P}$ be an algebraic number field. We provide a computational analog of the strong approximation theorem for finitely generated Zariski dense groups $H\leq \mathrm{SL}(n,\mathbb{P})$, $n$ prime. That is, we present algorithms to…
Let $k$ be an algebraically closed field of characteristic $p>0$. In this master thesis, we classify multiplicity-free tensor products of simple modules for the groups $SL_2(k)$ and $SL_3(k)$. We also provide a classification for $SL_n(k)$…