相关论文: Functions on groups and computational complexity

This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…

We survey recent results about asymptotic functions of groups, obtained by the authors in collaboration with J.-C.Birget, V. Guba and E. Rips. We also discuss methods used in the proofs of these results.

We provide partial results towards a conjectural generalization of a theorem of Lubotzky-Mozes-Raghunathan for arithmetic groups (over number fields or function fields) that implies, in low dimensions, both polynomial isoperimetric…

In this paper we turn the spotlight on a class of lexicographic ranking functions introduced by Bradley, Manna and Sipma in a seminal CAV 2005 paper, and establish for the first time the complexity of some problems involving the inference…

This paper continues the functional approach to the P-versus-NP problem, begun in [1]. Here we focus on the monoid RM_2^P of right-ideal morphisms of the free monoid, that have polynomial input balance and polynomial time-complexity. We…

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…

A new pair of asymptotic invariants for finitely presented groups, called intrinsic and extrinsic tame filling functions, are introduced. These filling functions are quasi-isometry invariants that strengthen the notions of intrinsic and…

We observe that a function on a group equipped with a bi-invariant word metric is Lipschitz if and only if it is a partial quasimorphism bounded on the generating set. We also show that an undistorted element is always detected by an…

This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…

Let X be a finite CW complex or compact Lipschitz neighborhood retract with universal cover Z; let M be a compact orientable manifold of dimension at least 2 and nonempty boundary. We establish the existence of an isoperimetric profile for…

We give extensional and intensional characterizations of functional programs with nondeterminism: as structure preserving functions between biorders, and as nondeterministic sequential algorithms on ordered concrete data structures which…

An extension of the finite and infinite Lie groups properties of complex numbers and functions of complex variable is proposed. This extension is performed exploiting hypercomplex number systems that follow the elementary algebra rules. In…

Let $A \cong k\langle X \rangle / I$ be an associative algebra. A finite word over alphabet $X$ is $I${\it-reducible} if its image in $A$ is a $k$-linear combination of length-lexicographically lesser words. An {\it obstruction} in a…

It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…

We answer two questions on the complexities of decision problems of groups, each related to a classical result. First, C. Miller characterized the complexity of the isomorphism problem for finitely presented groups in 1971. We do the same…

In this article, we construct semiparametrically efficient estimators of linear functionals of a probability measure in the presence of side information using an easy empirical likelihood approach. We use estimated constraint functions and…

We introduce the "loop shortening property" and the "basepoint loop shortening property" for finitely generated groups, and examine their relation to quadratic isoperimetric functions and almost convexity.

En esta serie de tres articulos, damos una exposicion de varios resultados y problemas abiertos en tres areas de la combinatoria algebraica y geometrica: las matrices totalmente no negativas, las representaciones del grupo simetrico, y los…

In comparison to graphs, combinatorial methods for the isomorphism problem of finite groups are less developed than algebraic ones. To be able to investigate the descriptive complexity of finite groups and the group isomorphism problem, we…

We prove an isoperimetric inequality for groups. As an application, we obtain lower bound on F{\o}lner functions in various nilpotent-by-cyclic groups. Under a regularity assumption, we obtain a characterization of F{\o}lner functions of…