Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Weakly minimal groups with a new predicate
Fix a weakly minimal (i.e. superstable [Formula: see text]-rank [Formula: see text]) structure [Formula: see text]. Let [Formula: see text] be an expansion by constants for an elementary substructure, and let [Formula: see text] be an arbitrary subset of the universe [Formula: see text]. We show that all formulas in the expansion [Formula: see text] are equivalent to bounded formulas, and so [Formula: see text] is stable (or NIP) if and only if the [Formula: see text]-induced structure [Formula: see text] on [Formula: see text] is stable (or NIP). We then restrict to the case that [Formula: see text] is a pure abelian group with a weakly minimal theory, and [Formula: see text] is mutually algebraic (equivalently, weakly minimal with trivial forking). This setting encompasses most of the recent research on stable expansions of [Formula: see text]. Using various characterizations of mutual algebraicity, we give new examples of stable structures of the form [Formula: see text]. Most notably, we show that if [Formula: see text] is a weakly minimal additive subgroup of the algebraic numbers, [Formula: see text] is enumerated by a homogeneous linear recurrence relation with algebraic coefficients, and no repeated root of the characteristic polynomial of [Formula: see text] is a root of unity, then [Formula: see text] is superstable for any [Formula: see text].  more » « less
Award ID(s):
1855789
PAR ID:
10409415
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Journal of Mathematical Logic
Volume:
20
Issue:
02
ISSN:
0219-0613
Page Range / eLocation ID:
2050011
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Journal of Mathematical Logic)
    We prove a number of results relating the concepts of Keisler measures, generic stability, randomizations and NIP formulas. Among other things, we do the following: (1)We introduce the notion of a Keisler–Morley measure, which plays the role of a Morley sequence for a Keisler measure. We prove that if [Formula: see text] is fim over [Formula: see text], then for any Keisler–Morley measure [Formula: see text] in [Formula: see text] over [Formula: see text] and any formula [Formula: see text], [Formula: see text]. We also show that any measure satisfying this conclusion must be fam.(2)We study the map, defined by Ben Yaacov, taking a definable measure [Formula: see text] to a type [Formula: see text] in the randomization. We prove that this map commutes with Morley products, and that if [Formula: see text] is fim then [Formula: see text] is generically stable.(3)We characterize when generically stable types are closed under Morley products by means of a variation of ict-patterns. Moreover, we show that NTP2theories satisfy this property.(4)We prove that if a local measure admits a suitably tame global extension, then it has finite packing numbers with respect to any definable family. We also characterize NIP formulas via the existence of tame extensions for local measures. 
    more » « less
  2. ; (, Journal of Topology and Analysis)
    Let [Formula: see text] be a Baumslag–Solitar group and let [Formula: see text] be a complex reductive algebraic group with maximal compact subgroup [Formula: see text]. We show that, when [Formula: see text] and [Formula: see text] are relatively prime with distinct absolute values, there is a strong deformation retraction of [Formula: see text] onto [Formula: see text]. 
    more » « less
  3. ; (, Journal of Algebra and Its Applications)
    Let [Formula: see text] be a residually finite dimensional algebra (not necessarily associative) over a field [Formula: see text]. Suppose first that [Formula: see text] is algebraically closed. We show that if [Formula: see text] satisfies a homogeneous almost identity [Formula: see text], then [Formula: see text] has an ideal of finite codimension satisfying the identity [Formula: see text]. Using well known results of Zelmanov, we conclude that, if a residually finite dimensional Lie algebra [Formula: see text] over [Formula: see text] is almost [Formula: see text]-Engel, then [Formula: see text] has a nilpotent (respectively, locally nilpotent) ideal of finite codimension if char [Formula: see text] (respectively, char [Formula: see text]). Next, suppose that [Formula: see text] is finite (so [Formula: see text] is residually finite). We prove that, if [Formula: see text] satisfies a homogeneous probabilistic identity [Formula: see text], then [Formula: see text] is a coset identity of [Formula: see text]. Moreover, if [Formula: see text] is multilinear, then [Formula: see text] is an identity of some finite index ideal of [Formula: see text]. Along the way we show that if [Formula: see text] has degree [Formula: see text], and [Formula: see text] is a finite [Formula: see text]-algebra such that the probability that [Formula: see text] (where [Formula: see text] are randomly chosen) is at least [Formula: see text], then [Formula: see text] is an identity of [Formula: see text]. This solves a ring-theoretic analogue of a (still open) group-theoretic problem posed by Dixon, 
    more » « less
  4. ; ; ; ; (, Journal of Algebra and Its Applications)
    Let [Formula: see text] be a complete local (Noetherian) ring. For each [Formula: see text], let [Formula: see text] be a nonempty countable set of nonmaximal, pairwise incomparable prime ideals of [Formula: see text], and suppose that if [Formula: see text], then either [Formula: see text] or no element of [Formula: see text] is contained in an element of [Formula: see text]. We provide necessary and sufficient conditions for [Formula: see text] to be the completion of a local integral domain [Formula: see text] satisfying the condition that, for all [Formula: see text], there is a nonzero prime element [Formula: see text] of [Formula: see text] such that [Formula: see text] is exactly the set of maximal elements of the formal fiber of [Formula: see text] at [Formula: see text]. We then prove related results where the domain [Formula: see text] is required to be countable and/or excellent. 
    more » « less
  5. ; (, Mathematics of Operations Research)
    Let [Formula: see text] be an instance of the stable marriage problem in which every vertex ranks its neighbors in a strict order of preference. A matching [Formula: see text] in [Formula: see text] is popular if [Formula: see text] does not lose a head-to-head election against any matching. Popular matchings generalize stable matchings. Unfortunately, when there are edge costs, to find or even approximate up to any factor a popular matching of minimum cost is NP-hard. Let [Formula: see text] be the cost of a min-cost popular matching. Our goal is to efficiently compute a matching of cost at most [Formula: see text] by paying the price of mildly relaxing popularity. Our main positive results are two bicriteria algorithms that find in polynomial time a “quasi-popular” matching of cost at most [Formula: see text]. Moreover, one of the algorithms finds a quasi-popular matching of cost at most that of a min-cost popular fractional matching, which could be much smaller than [Formula: see text]. Key to the other algorithm is a polynomial-size extended formulation for an integral polytope sandwiched between the popular and quasi-popular matching polytopes. We complement these results by showing that it is NP-hard to find a quasi-popular matching of minimum cost and that both the popular and quasi-popular matching polytopes have near-exponential extension complexity. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Text Encoded Conversion
  • XML
  • Save / Share this Record
  • Send to Email