相关论文: Functions on groups and computational complexity
The paper is devoted to the study of some well-knonw combinatorial functions on the symmetric group $\sn$ --- the major index $\maj$, the descent number $\des$, and the inversion number $\inv$ --- from the representation-theoretic point of…
Upper semicontinuous (usc) functions arise in the analysis of maximization problems, distributionally robust optimization, and function identification, which includes many problems of nonparametric statistics. We establish that every usc…
We study the optimization of functions with $n>2$ arguments that have a representation as a sum of several functions that have only $2$ of the $n$ arguments each, termed sums of bivariates, on finite domains. The complexity of optimizing…
The results presented in this paper are refinements of some results presented in a previous paper. Three such refined results are presented. The first one relaxes one of the basic hypotheses assumed in the previous paper, and thus extends…
Nonparametric extension of tensor regression is proposed. Nonlinearity in a high-dimensional tensor space is broken into simple local functions by incorporating low-rank tensor decomposition. Compared to naive nonparametric approaches, our…
We give a summary of the results from Parts I-V (math.RT/9804086, math.RT/9804087, math.RT/9804088, math.RT/9810013, math.RT/9810014). Our work originated from harmonic analysis on the infinite symmetric group. The problem of spectral…
We give Scott sentences for certain computable groups, and we use index set calculations as a way of checking that our Scott sentences are as simple as possible. We consider finitely generated groups and torsion-free abelian groups of…
In this paper, we present a dual representation of the influence functions, whose computational complexity scales with dataset size rather than model size. Both analytically and experimentally, we show that this representation can be an…
We study two complexity notions of groups - a computable Scott sentence and the index set of a group. Finding the exact complexity of one of them usually involves finding the complexity of the other, but this is not the case sometimes. J.…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
In this paper we associate with an infinite family of real extended functions defined on a locally convex space, a sum, called robust sum, which is always well-defined. We also associate with that family of functions a dual pair of problems…
Finite decomposition complexity and asymptotic dimension growth are two generalizations of M. Gromov's asymptotic dimension which can be used to prove property A for large classes of finitely generated groups of infinite asymptotic…
We present new computational results for symplectic monodromy groups of hypergeometric differential equations. In particular, we compute the arithmetic closure of each group, sometimes justifying arithmeticity. The results are obtained by…
Higher genus partition functions of two-dimensional conformal field theories have to be invariants under linear actions of mapping class groups. We illustrate recent results [4,6] on the construction of such invariants by concrete…
Symmetry plays a basic role in variational problems (settled e.g. in $\mathbb R^{n}$ or in a more general manifold), for example to deal with the lack of compactness which naturally appear when the problem is invariant under the action of a…
Using appropriate notation systems for proofs, cut-reduction can often be rendered feasible on these notations, and explicit bounds can be given. Developing a suitable notation system for Bounded Arithmetic, and applying these bounds, all…
We develop techniques at the interface between differential algebra and model theory to study the following problems of exponential algebraicity: Does a given algebraic differential equation admits an exponentially algebraic solution, that…
We present an algorithm for the following problem: given a context-free grammar for the word problem of a virtually free group $G$, compute a finite graph of groups $\mathcal{G}$ with finite vertex groups and fundamental group $G$. Our…
To each finitely generated group $G$, we associate a quasi-isometric invariant called the \emph{Dehn spectrum} of $G$. If $G$ is finitely presented, our invariant is closely related to the Dehn function of $G$, but provides more information…
The notion of spherically symmetric superfunctions as functions invariant under the orthosymplectic group is introduced. This leads to dimensional reduction theorems for differentiation and integration in superspace. These spherically…