Related papers: Algorithms for experimenting with Zariski dense su…

In this paper a robust second-order method is developed for the solution of strongly convex l1-regularized problems. The main aim is to make the proposed method as inexpensive as possible, while even difficult problems can be efficiently…

We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times. We show that…

In this thesis, we develop algorithms similar to the Gaussian elimination algorithm in symplectic and split orthogonal similitude groups. As an application to this algorithm, we compute the spinor norm for split orthogonal groups. Also, we…

We propose an unconstrained optimization method based on the well-known primal-dual hybrid gradient (PDHG) algorithm. We first formulate the optimality condition of the unconstrained optimization problem as a saddle point problem. We then…

Let $\Lambda$ be a subgroup of an arithmetic lattice in SO(n+1,1). The quotient $\mathbb{H}^{n+1} / \Lambda$ has a natural family of congruence covers corresponding to primes in some ring of integers. We establish a super-strong…

We study the transience of algebraic varieties in linear groups. In particular, we show that a "non elementary" random walk in SL_2(R) escapes exponentially fast from every proper algebraic subvariety. We also treat the case where the…

We develop and collect techniques for determining Hochschild cohomology of skew group algebras S(V)#G and apply our results to graded Hecke algebras. We discuss the explicit computation of certain types of invariants under centralizer…

Let $G_1$ denote the incidence graph of the complete graph $K_{q+1}$. We study limited augmented Zarankiewicz numbers in this family by combining exact 0--1 ILP computations for the smallest cases with a constructive search procedure…

This note describes a unified approach to several superrigidity results, old and new, concerning representations of lattices into simple algebraic groups over local fields. For an arbitrary group $\Gamma$ and a $\Gamma$-boundary $B$ we…

In this paper, we determine the descriptive complexity of subsets of the Polish space of marked groups defined by various group theoretic properties. In particular, using Grigorchuk groups, we establish that the sets of solvable groups,…

For W a finite (2-)reflection group and B its (generalized) braid group, we determine the Zariski closure of the image of B inside the corresponding Iwahori-Hecke algebra. The Lie algebra of this closure is reductive and generated in the…

Let $G$ be a finite group, $N$ a nilpotent normal subgroup of $G$ and let $\mathrm{V}(\mathbb{\Z} G, N)$ denote the group formed by the units of the integral group ring $\mathbb{\Z} G$ of $G$ which map to the identity under the natural…

We consider the problem of sampling and approximately counting an arbitrary given motif $H$ in a graph $G$, where access to $G$ is given via queries: degree, neighbor, and pair, as well as uniform edge sample queries. Previous algorithms…

We begin by showing that commensurators of Zariski dense subgroups of isometry groups of symmetric spaces of non-compact type are discrete provided that the limit set on the Furstenberg boundary is not invariant under the action of a…

For a finite $\mathbb{Z}$-algebra $R$, i.e., for a $\mathbb{Z}$-algebra which is a finitely generated $\mathbb{Z}$-module, we assume that $R$ is explicitly given by a system of $\mathbb{Z}$-module generators $G$, its relation module ${\rm…

We develop the affine sieve in the context of orbits of congruence subgroups of semi-simple groups acting linearly on affine space. In particular we give effective bounds for the saturation numbers for points on such orbits at which the…

We advocate a new approach of addressing hidden structure problems and finding efficient quantum algorithms. We introduce and investigate the Hidden Symmetry Subgroup Problem (HSSP), which is a generalization of the well-studied Hidden…

We survey group-theoretic algorithms for finding (some or all) subgroups of a finite group and discuss the implementation of these algorithms in the computer algebra system GAP

In this paper we present a complete iteration complexity analysis of inexact first order Lagrangian and penalty methods for solving cone constrained convex problems that have or may not have optimal Lagrange multipliers that close the…

Let $S$ be a finite set of primes. For sufficiently large $n$ and $d$, Lawrence and Venkatesh proved that in the moduli space of hypersurfaces of degree $d$ in $\mathbb{P}^n$, the locus of points with good reduction outside $S$ is not…