Related papers: An algorithm for computing syzygies on $V[X]$ when…
In this paper, for any Shimura datum $(G,\mathcal{D})$ satisfying reasonable conditions so that many interesting cases satisfy, we prove some finiteness theorems for any graded vector space consisting of automorphic forms on $\mathcal{D}$…
This paper studies the estimation of ranked-list discrete choice models with single and multiple purchases. In this setting, each consumer type is characterized by a ranking over a subset of products and a desired number of purchases, and…
We present a survey of the saturation method for model-checking pushdown systems.
Let $G$ be a finite solvable group, given through a refined consistent polycyclic presentation, and $\alpha$ an automorphism of $G$, given through its images of the generators of $G$. In this paper, we discuss algorithms for computing the…
We present a practical and powerful new framework for both unconstrained and constrained submodular function optimization based on discrete semidifferentials (sub- and super-differentials). The resulting algorithms, which repeatedly compute…
Let $R$ be a complete equicharacteristic noetherian local domain and $\nu$ a valuation of its field of fractions whose valuation ring dominates $R$ with trivial residue field extension. The semigroup of values of $\nu$ on $R\setminus \{0\}$…
The ring of invariant polynomials ${\mathbb C}[V]^G$ over a given finite dimensional representation space $V$ of a complex reductive group $G$ is known, by a famous theorem of Hilbert, to be finitely generated. The general proof being…
We give a procedure that can be used to automatically satisfy invariants of a certain shape. These invariants may be written with the operations intersection, composition and converse over binary relations, and equality over these…
Let $(M,\tau,\sigma,\Gamma)$ be a (finite) von Neumann dynamical system and let $N$ be a $\Gamma$-invariant unital von Neumann subalgebra of $M$. If $V\subset L^2(M)$ is a right $N$-submodule whose projection $p_V$ has finite trace in $<…
We exhibit an algorithm to compute a Dirichlet domain for a cofinite Fuchsian group Gamma. As a consequence, we compute the invariants of Gamma, including an explicit finite presentation for Gamma.
Let E be a number field and G be a finite group. Let A be any O_E-order of full rank in the group algebra E[G] and X be a (left) A-lattice. In a previous article, we gave a necessary and sufficient condition for X to be free of given rank d…
Submodularity is a fundamental phenomenon in combinatorial optimization. Submodular functions occur in a variety of combinatorial settings such as coverage problems, cut problems, welfare maximization, and many more. Therefore, a lot of…
The semina\"ive algorithm can materialise all consequences of arbitrary datalog rules, and it also forms the basis for incremental algorithms that update a materialisation as the input facts change. Certain (combinations of) rules, however,…
In this survey we discuss work of Levin and V'yugin on collections of sequences that are non-negligible in the sense that they can be computed by a probabilistic algorithm with positive probability. More precisely, Levin and V'yugin…
This paper addresses the problem of sequential submodular maximization: selecting and ranking items in a sequence to optimize some composite submodular function. In contrast to most of the previous works, which assume access to the utility…
We introduce the concept of a sum-rank saturating system and outline its correspondence to a covering properties of a sum-rank metric code. We consider the problem of determining the shortest sum-rank-$\rho$-saturating systems of a fixed…
A series of associative algebras $A_n(V)$ for a vertex operator algebra $V$ over an arbitrary algebraically closed field and nonnegative integers $n$ are constructed such that there is a one to one correspondence between irreducible…
We consider the growth, order, and finiteness problems for automaton (semi)groups. We propose new implementations and compare them with the existing ones. As a result of extensive experimentations, we propose some conjectures on the order…
We develop a theory of Valuation Hilbert Modules and prove a version of Beurling's theorem for these. Then we apply our version of Beurling's theorem to obtain complete descriptions of the closed invariant subspaces of a number of Hilbert…
Optimizations in a traditional compiler are applied sequentially, with each optimization destructively modifying the program to produce a transformed program that is then passed to the next optimization. We present a new approach for…