English
Related papers

Related papers: Some Arithmetic Properties of Complex Local System…

200 papers

Intersection homology is obtained from ordinary homology by imposing conditions on how the embedded simplices meet the strata of a space $X$. In this way, for the middle perversity, properties such as strong Lefschetz are preserved. This…

Algebraic Topology · Mathematics 2007-05-23 Jonathan Fine

This paper provides a general result on controlling local Rademacher complexities, which captures in an elegant form to relate the complexities with constraint on the expected norm to the corresponding ones with constraint on the empirical…

Artificial Intelligence · Computer Science 2015-10-07 Yunwen Lei , Lixin Ding , Yingzhou Bi

We introduce geometric and homological finiteness properties for countable approximate groups via coarse geometry and then study these finiteness properties for S-arithmetic reductive approximate groups. For S-arithmetic approximate groups…

Group Theory · Mathematics 2022-04-05 Tobias Hartnick , Stefan Witzel

The objective of this series is to study metric geometric properties of (coarse) disjoint unions of amenable Cayley graphs. We employ the Cayley topology and observe connections between large scale structure of metric spaces and group…

Group Theory · Mathematics 2019-03-13 Masato Mimura , Hiroki Sako

Let $(X,G)$, $(Y,G)$ be two $G$-systems, where $G$ is an infinite countable discrete amenable group and $X$, $Y$ are compact metric spaces. Suppose that $\mathcal{U}$ is a cover of $X$. We first introduce the conditional local topological…

Dynamical Systems · Mathematics 2025-09-26 J. Huang , Z. Xiao

A new method is given for computing generators of the homology groups with integer coefficients for any finite $T_0$-space. An important role in this method is played by irreducible cycles which are defined here and give rise to continuous…

Algebraic Topology · Mathematics 2018-11-13 Patrick Erik Bradley

We determine when an arithmetic subgroup of a reductive group defined over a global function field is of type FP_\infty by comparing its large-scale geometry to the large-scale geometry of lattices in real semisimple Lie groups.

Group Theory · Mathematics 2007-05-23 Kai-Uwe Bux , Kevin Wortman

Let $A$ be a ring and $R$ be a polynomial or a power series ring over $A$. When $A$ has dimension zero, we show that the Bass numbers and the associated primes of the local cohomology modules over $R$ are finite. Moreover, if $A$ has…

Commutative Algebra · Mathematics 2013-11-01 Luis Nunez-Betancourt

Local algorithms on graphs are algorithms that run in parallel on the nodes of a graph to compute some global structural feature of the graph. Such algorithms use only local information available at nodes to determine local aspects of the…

Probability · Mathematics 2013-04-09 David Gamarnik , Madhu Sudan

In this paper the local singularities of integrable Hamiltonian systems with two degrees of freedom are studied. The topological obstruction to the existence of focus-focus singularity with given complexity was found. It has been showed…

Dynamical Systems · Mathematics 2014-03-25 Gleb Smirnov

Like with most large-scale systems, the evaluation of quantitative properties of collective adaptive systems is an important issue that crosscuts all its development stages, from design (in the case of engineered systems) to runtime…

Systems and Control · Computer Science 2016-07-12 Mirco Tribastone

The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…

Logic · Mathematics 2008-03-25 Wesley Calvert , Valentina S. Harizanov , Julia F. Knight , Sara Miller

The incompressibility method is a counting argument in the framework of algorithmic complexity that permits discovering properties that are satisfied by most objects of a class. This paper gives a preliminary insight into Kolmogorov's…

Information Theory · Computer Science 2024-07-25 Carles Cardó

In this paper we discuss some recent results about extremal contractions of complex algebraic varieties. These are proper surjective maps, $\phi: X\longrightarrow Z$, of normal varieties with connected fibers such that $X$ has mild…

alg-geom · Mathematics 2008-02-03 Marco Andreatta , Jaroslaw A. Wiśniewski

We introduce the notion of integrable connections for a sheaf of differential graded algebras on a topological space. We then describe them in the finite locally projective setting, when the sheaf is either the de Rham complex of a formal…

Algebraic Geometry · Mathematics 2025-02-05 Rubén Muñoz--Bertrand

Local properties of the fundamental group of a path-connected topological space can pose obstructions to the applicability of covering space theory. A generalized covering map is a generalization of the classical notion of covering map…

Algebraic Topology · Mathematics 2020-04-14 Jeremy Brazas , Hanspeter Fischer

This paper is a commutative algebra introduction to the homological theory of quasi-coherent sheaves and contraherent cosheaves over quasi-compact semi-separated schemes. Antilocality is an alternative way in which global properties are…

Commutative Algebra · Mathematics 2024-02-26 Leonid Positselski

Structural properties of unitary groups over local, not necessarily commutative, rings are developed, with applications to the computation of the orders of these groups (when finite) and to the degrees of the irreducible constituents of the…

Group Theory · Mathematics 2013-03-22 J. Cruickshank , A. Herman , R. Quinlan , F. Szechtman

In this paper, the Lipschitz clustering property of a metric space refers to the existence of Lipschitz retractions between its finite subset spaces. Obstructions to this property can be either topological or geometric features of the…

Metric Geometry · Mathematics 2022-12-20 Leonid V. Kovalev

We prove a general structural theorem for a wide family of local algorithms, which includes property testers, local decoders, and PCPs of proximity. Namely, we show that the structure of every algorithm that makes $q$ adaptive queries and…

Computational Complexity · Computer Science 2023-12-13 Marcel Dall'Agnol , Tom Gur , Oded Lachish