539,660 research outputs found

    Direction problems in affine spaces

    Full text link
    This paper is a survey paper on old and recent results on direction problems in finite dimensional affine spaces over a finite field.Comment: Academy Contact Forum "Galois geometries and applications", October 5, 2012, Brussels, Belgiu

    Influence of mean distance between fibers on the effective gas thermal conductivity in highly porous fibrous materials

    Get PDF
    This work was supported by the Russian Goverment Grant No. 14.Z50.31.0036.Peer reviewedPostprin

    Compactifications of Heterotic Strings on Non-Kahler Complex Manifolds: II

    Full text link
    We continue our study of heterotic compactifications on non-Kahler complex manifolds with torsion. We give further evidence of the consistency of the six-dimensional manifold presented earlier and discuss the anomaly cancellation and possible supergravity description for a generic non-Kahler complex manifold using the newly proposed superpotential. The manifolds studied in our earlier papers had zero Euler characteristics. We construct new examples of non-Kahler complex manifolds with torsion in lower dimensions, that have non-zero Euler characteristics. Some of these examples are constructed from consistent backgrounds in F-theory and therefore are solutions to the string equations of motion. We discuss consistency conditions for compactifications of the heterotic string on smooth non-Kahler manifolds and illustrate how some results well known for Calabi-Yau compactifications, including counting the number of generations, apply to the non-Kahler case. We briefly address various issues regarding possible phenomenological applications.Comment: 106 pages, 8 .eps figures, Harvmac; v2: Some sections expanded, typos corrected and references updated; v3: More typos corrected, one section expanded and references added. Final version to appear in Nucl. Phys.

    On the number of tetrahedra with minimum, unit, and distinct volumes in three-space

    Full text link
    We formulate and give partial answers to several combinatorial problems on volumes of simplices determined by nn points in 3-space, and in general in dd dimensions. (i) The number of tetrahedra of minimum (nonzero) volume spanned by nn points in \RR^3 is at most 2/3n3O(n2){2/3}n^3-O(n^2), and there are point sets for which this number is 3/16n3O(n2){3/16}n^3-O(n^2). We also present an O(n3)O(n^3) time algorithm for reporting all tetrahedra of minimum nonzero volume, and thereby extend an algorithm of Edelsbrunner, O'Rourke, and Seidel. In general, for every k,d\in \NN, 1kd1\leq k \leq d, the maximum number of kk-dimensional simplices of minimum (nonzero) volume spanned by nn points in \RR^d is Θ(nk)\Theta(n^k). (ii) The number of unit-volume tetrahedra determined by nn points in \RR^3 is O(n7/2)O(n^{7/2}), and there are point sets for which this number is Ω(n3loglogn)\Omega(n^3 \log \log{n}). (iii) For every d\in \NN, the minimum number of distinct volumes of all full-dimensional simplices determined by nn points in \RR^d, not all on a hyperplane, is Θ(n)\Theta(n).Comment: 19 pages, 3 figures, a preliminary version has appeard in proceedings of the ACM-SIAM Symposium on Discrete Algorithms, 200

    Nivat's conjecture holds for sums of two periodic configurations

    Full text link
    Nivat's conjecture is a long-standing open combinatorial problem. It concerns two-dimensional configurations, that is, maps Z2A\mathbb Z^2 \rightarrow \mathcal A where A\mathcal A is a finite set of symbols. Such configurations are often understood as colorings of a two-dimensional square grid. Let Pc(m,n)P_c(m,n) denote the number of distinct m×nm \times n block patterns occurring in a configuration cc. Configurations satisfying Pc(m,n)mnP_c(m,n) \leq mn for some m,nNm,n \in \mathbb N are said to have low rectangular complexity. Nivat conjectured that such configurations are necessarily periodic. Recently, Kari and the author showed that low complexity configurations can be decomposed into a sum of periodic configurations. In this paper we show that if there are at most two components, Nivat's conjecture holds. As a corollary we obtain an alternative proof of a result of Cyr and Kra: If there exist m,nNm,n \in \mathbb N such that Pc(m,n)mn/2P_c(m,n) \leq mn/2, then cc is periodic. The technique used in this paper combines the algebraic approach of Kari and the author with balanced sets of Cyr and Kra.Comment: Accepted for SOFSEM 2018. This version includes an appendix with proofs. 12 pages + references + appendi
    corecore