English
Related papers

Related papers: Invariant Ideal Axiom

200 papers

A causal set is a partially ordered set on a countably infinite ground-set such that each element is above finitely many others. A natural extension of a causal set is an enumeration of its elements which respects the order. We bring…

Probability · Mathematics 2011-09-22 Graham Brightwell , Malwina Luczak

We provide a treatment of isomorphism within a set-theoretic formulation of dependent type theory. Type expressions are assigned their natural set-theoretic compositional meaning. Types are divided into small and large types --- sets and…

Logic in Computer Science · Computer Science 2018-01-23 David McAllester

We study, in an abstract axiomatic setting, the notion of sectional category of a morphism. From this, we unify and generalize known results about this invariant in different settings as well as we deduce new applications.

Category Theory · Mathematics 2012-02-23 F. Diaz , J. Calcines , P. Garcia , A. Murillo , J. Remedios

We formulate a notion of "geometric reductivity" in an abstract categorical setting which we refer to as adequacy. The main theorem states that the adequacy condition implies that the ring of invariants is finitely generated. This result…

Algebraic Geometry · Mathematics 2010-11-10 Jarod Alper , A. J. de Jong

Thermodynamics can be formulated in either of two approaches, the phenomenological approach, which refers to the macroscopic properties of systems, and the statistical approach, which describes systems in terms of their microscopic…

Quantum Physics · Physics 2019-05-01 Mirjam Weilenmann , Lea Krämer Gabriel , Philippe Faist , Renato Renner

We give axioms in the language of rings augmented by a 1-ary predicate symbol $Fin(x)$ with intended interpretation in the Boolean algebra of idempotents as the ideal of finite elements, i.e. finite unions of atoms. We prove that any…

Logic · Mathematics 2020-07-21 Jamshid Derakhshan , Angus Macintyre

I show that one can explicitly construct topologically/geometrically distinguishable data which provide isomorphic copies (i.e. \emph{isomorphs}) of the tempered fundamental group of a geometrically connected, smooth, quasi-projective…

Algebraic Geometry · Mathematics 2023-03-21 Kirti Joshi

We develop an axiomatic set theory -- the Theory of Hyperfinite Sets THS, which is based on the idea of existence of proper subclasses of big finite sets. We demonstrate how theorems of classical continuous mathematics can be transfered to…

Logic · Mathematics 2007-05-23 P. V. Andreev , E. I. Gordon

Uniformly finite homology is a coarse invariant for metric spaces; in particular, it is a quasi-isometry invariant for finitely generated groups. In this article, we study uniformly finite homology of finitely generated amenable groups and…

Group Theory · Mathematics 2016-01-20 Matthias Blank , Francesca Diana

We show that including degrees of a particular kind of provability in the search target for any theorem-prover in sufficiently powerful formal systems over finite-sized statements preserves well-definition and a sufficient consistency while…

Logic · Mathematics 2024-11-28 Rohan Bahl

We introduce a new graph invariant of finite groups that provides a complete characterization of the splitting types of unramified prime ideals in normal number field extensions entirely in terms of the Galois group. In particular, each…

Number Theory · Mathematics 2007-05-23 Fusun Akman

A notion of sectional regularity for a homogeneous ideal $I$, which measures the regularity of its generic sections with respect to linear spaces of various dimensions, is introduced. It is related to axial constants defined as the…

The concept of a local infimum for an optimal control problem is introduced. This definition extends that of an optimal process. For a~local infimum we prove an existence theorem and derive necessary conditions that resemble some family of…

Optimization and Control · Mathematics 2019-06-21 Evgeny Avakov , Georgii Magaril-Il'yaev

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

Let $R$ be a reduced affine $\mathbb C$-algebra, with corresponding affine algebraic set $X$. Let $\mathcal C(X)$ be the ring of continuous (Euclidean topology) $\mathbb C$-valued functions on $X$. Brenner defined the \emph{continuous…

Commutative Algebra · Mathematics 2015-07-03 Neil Epstein , Melvin Hochster

We introduce the concept of topological finite-determinacy for germs of analytic functions within a fixed ideal $I$, which provides a notion of topological finite-determinacy of functions with non-isolated singularities. We prove the…

Algebraic Geometry · Mathematics 2007-05-23 J. Fernandez de Bobadilla

We consider an Axiom A diffeomorphism and the invariant set $\Omega$ of orbits which never falls into a fixed hole. We study various aspects of the complexity of the symbolic representation of $\Omega$. Our main result are that each…

Dynamical Systems · Mathematics 2007-05-23 S. Bundfuss , T. Krueger , S. Troubetzkoy

In this paper the turnpike property is established for a non-convex optimal control problem in discrete time. The functional is defined by the notion of the ideal convergence and can be considered as an analogue of the terminal functional…

Optimization and Control · Mathematics 2022-11-01 Musa Mammadov , Piotr Szuca

Modular reasoning about class invariants is challenging in the presence of dependencies among collaborating objects that need to maintain global consistency. This paper presents semantic collaboration: a novel methodology to specify and…

Software Engineering · Computer Science 2014-05-08 Nadia Polikarpova , Julian Tschannen , Carlo A. Furia , Bertrand Meyer

Given an $\omega$-automaton and a set of substitutions, we look at which accepted words can also be defined through these substitutions, and in particular if there is at least one. We introduce a method using desubstitution of…

Formal Languages and Automata Theory · Computer Science 2023-04-12 Pierre Béaur , Benjamin Hellouin de Menibus
‹ Prev 1 3 4 5 6 7 10 Next ›