1,949,493 research outputs found

    Generic substitutions

    Full text link
    Up to equivalence, a substitution in propositional logic is an endomorphism of its free algebra. On the dual space, this results in a continuous function, and whenever the space carries a natural measure one may ask about the stochastic properties of the action. In classical logic there is a strong dichotomy: while over finitely many propositional variables everything is trivial, the study of the continuous transformations of the Cantor space is the subject of an extensive literature, and is far from being a completed task. In many-valued logic this dichotomy disappears: already in the finite-variable case many interesting phenomena occur, and the present paper aims at displaying some of these.Comment: 22 pages, 2 figures. Revised version according to the referee's suggestions. To appear in the J. of Symbolic Logi

    Type Generic Observing

    Get PDF
    Observing intermediate values helps to understand what is going on when your program runs. Gill presented an observation method for lazy functional languages that preserves the program's semantics. However, users need to define for each type how its values are observed: a laborious task and strictness of the program can easily be affected. Here we define how any value can be observed based on the structure of its type by applying generic programming frameworks. Furthermore we present an extension to specify per observation point how much to observe of a value. We discuss especially functional values and behaviour based on class membership in generic programming frameworks

    Fibers of Generic Projections

    Full text link
    Let X be a smooth projective variety of dimension n in P^r. We study the fibers of a general linear projection pi: X --> P^{n+c}, with c > 0. When n is small it is classical that the degree of any fiber is bounded by n/c+1, but this fails for n >> 0. We describe a new invariant of the fiber that agrees with the degree in many cases and is always bounded by n/c+1. This implies, for example, that if we write a fiber as the disjoint union of schemes Y' and Y'' such that Y' is the union of the locally complete intersection components of Y, then deg Y'+deg Y''_red <= n/c+1 and this formula can be strengthened a little further. Our method also gives a sharp bound on the subvariety of P^r swept out by the l-secant lines of X for any positive integer l, and we discuss a corresponding bound for highly secant linear spaces of higher dimension. These results extend Ziv Ran's "Dimension+2 Secant Lemma".Comment: Proof of the main theorem simplified and new examples adde

    Zero entropy is generic

    Full text link
    Dan Rudolph showed that for an amenable group Γ\Gamma, the generic measure-preserving action of Γ\Gamma on a Lebesgue space has zero entropy. Here this is extended to nonamenable groups. In fact, the proof shows that every action is a factor of a zero entropy action! This uses the strange phenomena that in the presence of nonamenability, entropy can increase under a factor map. The proof uses Seward's recent generalization of Sinai's Factor Theorem, the Gaboriau-Lyons result and my theorem that for every nonabelian free group, all Bernoulli shifts factor onto each other.Comment: Comments welcome

    Generic cluster characters

    Full text link
    Let \CC be a Hom-finite triangulated 2-Calabi-Yau category with a cluster-tilting object TT. Under a constructibility condition we prove the existence of a set \mathcal G^T(\CC) of generic values of the cluster character associated to TT. If \CC has a cluster structure in the sense of Buan-Iyama-Reiten-Scott, \mathcal G^T(\CC) contains the set of cluster monomials of the corresponding cluster algebra. Moreover, these sets coincide if C\mathcal C has finitely many indecomposable objects. When \CC is the cluster category of an acyclic quiver and TT is the canonical cluster-tilting object, this set coincides with the set of generic variables previously introduced by the author in the context of acyclic cluster algebras. In particular, it allows to construct Z\Z-linear bases in acyclic cluster algebras.Comment: 24 pages. Final Version. In particular, a new section studying an explicit example was adde

    Generic Birkhoff Spectra

    Get PDF
    Suppose that Ω={0,1}N\Omega = \{0, 1\}^ {\mathbb {N}} and σ {\sigma} is the one-sided shift. The Birkhoff spectrum Sf(α)=dimH{ωΩ:limN1Nn=1Nf(σnω)=α}, \displaystyle S_{f}( {\alpha})=\dim_{H}\Big \{ {\omega}\in {\Omega}:\lim_{N \to \infty} \frac{1}{N} \sum_{n=1}^N f(\sigma^n \omega) = \alpha \Big \}, where dimH\dim_{H} is the Hausdorff dimension. It is well-known that the support of Sf(α)S_{f}( {\alpha}) is a bounded and closed interval Lf=[αf,min,αf,max]L_f = [\alpha_{f, \min}^*, \alpha_{f, \max}^*] and Sf(α)S_{f}( {\alpha}) on LfL_{f} is concave and upper semicontinuous. We are interested in possible shapes/properties of the spectrum, especially for generic/typical fC(Ω)f\in C( {\Omega}) in the sense of Baire category. For a dense set in C(Ω)C( {\Omega}) the spectrum is not continuous on R {\mathbb {R}}, though for the generic fC(Ω)f\in C( {\Omega}) the spectrum is continuous on R {\mathbb {R}}, but has infinite one-sided derivatives at the endpoints of LfL_{f}. We give an example of a function which has continuous SfS_{f} on R {\mathbb {R}}, but with finite one-sided derivatives at the endpoints of LfL_{f}. The spectrum of this function can be as close as possible to a "minimal spectrum". We use that if two functions ff and gg are close in C(Ω)C( {\Omega}) then SfS_{f} and SgS_{g} are close on LfL_{f} apart from neighborhoods of the endpoints.Comment: Revised version after the referee's repor

    Generic Spectrahedral Shadows

    Full text link
    Spectrahedral shadows are projections of linear sections of the cone of positive semidefinite matrices. We characterize the polynomials that vanish on the boundaries of these convex sets when both the section and the projection are generic.Comment: version to be publishe
    corecore