30,310 research outputs found

    A note on the factorization conjecture

    Full text link
    We give partial results on the factorization conjecture on codes proposed by Schutzenberger. We consider finite maximal codes C over the alphabet A = {a, b} with C \cap a^* = a^p, for a prime number p. Let P, S in Z , with S = S_0 + S_1, supp(S_0) \subset a^* and supp(S_1) \subset a^*b supp(S_0). We prove that if (P,S) is a factorization for C then (P,S) is positive, that is P,S have coefficients 0,1, and we characterize the structure of these codes. As a consequence, we prove that if C is a finite maximal code such that each word in C has at most 4 occurrences of b's and a^p is in C, then each factorization for C is a positive factorization. We also discuss the structure of these codes. The obtained results show once again relations between (positive) factorizations and factorizations of cyclic groups

    Hierarchical interpolative factorization for elliptic operators: differential equations

    Full text link
    This paper introduces the hierarchical interpolative factorization for elliptic partial differential equations (HIF-DE) in two (2D) and three dimensions (3D). This factorization takes the form of an approximate generalized LU/LDL decomposition that facilitates the efficient inversion of the discretized operator. HIF-DE is based on the multifrontal method but uses skeletonization on the separator fronts to sparsify the dense frontal matrices and thus reduce the cost. We conjecture that this strategy yields linear complexity in 2D and quasilinear complexity in 3D. Estimated linear complexity in 3D can be achieved by skeletonizing the compressed fronts themselves, which amounts geometrically to a recursive dimensional reduction scheme. Numerical experiments support our claims and further demonstrate the performance of our algorithm as a fast direct solver and preconditioner. MATLAB codes are freely available.Comment: 37 pages, 13 figures, 12 tables; to appear, Comm. Pure Appl. Math. arXiv admin note: substantial text overlap with arXiv:1307.266

    A note on the factorization of iterated quadratics over finite fields

    Full text link
    Let ff be a monic quadratic polynomial over a finite field of odd characteristic. In 2012, Boston and Jones constructed a Markov process based on the post-critical orbit of ff, and conjectured that its limiting distribution explains the factorization of large iterates of ff. Later on, Boston, Xia, and the author did extensive Magma computations and found some exceptional families of quadratics that do not seem to follow the original Markov model conjectured by Boston and Jones. They did this by empirically observing that certain factorization patterns predicted by the Boston-Jones model never seem to occur for these polynomials, and suggested a multi-step Markov model which takes these missing factorization patterns into account. In this note, we provide proofs for all these missing factorization patterns. These are the first provable results that explain why the original conjecture of Boston and Jones does not hold for \emph{all} monic quadratic polynomials.Comment: 12 page

    Sets of minimal distances and characterizations of class groups of Krull monoids

    Full text link
    Let HH be a Krull monoid with finite class group GG such that every class contains a prime divisor. Then every non-unit a∈Ha \in H can be written as a finite product of atoms, say a=u1⋅…⋅uka=u_1 \cdot \ldots \cdot u_k. The set L(a)\mathsf L (a) of all possible factorization lengths kk is called the set of lengths of aa. There is a constant M∈NM \in \mathbb N such that all sets of lengths are almost arithmetical multiprogressions with bound MM and with difference d∈Δ∗(H)d \in \Delta^* (H), where Δ∗(H)\Delta^* (H) denotes the set of minimal distances of HH. We study the structure of Δ∗(H)\Delta^* (H) and establish a characterization when Δ∗(H)\Delta^*(H) is an interval. The system L(H)={L(a)∣a∈H}\mathcal L (H) = \{ \mathsf L (a) \mid a \in H \} of all sets of lengths depends only on the class group GG, and a standing conjecture states that conversely the system L(H)\mathcal L (H) is characteristic for the class group. We confirm this conjecture (among others) if the class group is isomorphic to CnrC_n^r with r,n∈Nr,n \in \mathbb N and Δ∗(H)\Delta^*(H) is not an interval.Comment: To appear in The Ramanujan Journal. arXiv admin note: substantial text overlap with arXiv:1506.0522

    Eisenstein series and quantum groups

    Get PDF
    We sketch a proof of a conjecture of [FFKM] that relates the geometric Eisenstein series sheaf with semi-infinite cohomology of the small quantum group with coefficients in the tilting module for the big quantum group
    • …
    corecore