Results 81 to 90 of about 997,897 (240)
Simple juntas for shifted families
**For the moment the link is to the submitted version of the article. It will be updated when the final version has been posted to arXiv.** Simple juntas for shifted families, Discrete Analysis 2020:14, 18 pp.
Peter Frankl, Andrey Kupavskii
doaj +1 more source
Binary extremal self-dual codes of length $60$ and related codes [PDF]
We give a classification of four-circulant singly even self-dual $[60,30,d]$ codes for $d=10$ and $12$. These codes are used to construct extremal singly even self-dual $[60,30,12]$ codes with weight enumerator for which no extremal singly even self-dual code was previously known to exist. From extremal singly even self-dual $[60,30,12]$ codes, we also
arxiv +1 more source
A Simple Explanation for Harmonic Word Order
Abstract Harmonic word order is a well‐established tendency in natural languages, which has previously been explained as a single ordering rule for all head‐dependent relations. We propose that it can be more parsimoniously explained as an outcome of word‐class frequencies, where the purported “head” is the most frequently instantiated word class in a ...
John Mansfield, Lothar Sebastian Krapp
wiley +1 more source
A sharp higher order Sobolev embedding
Abstract We obtain sharp embeddings from the Sobolev space W0k,2(−1,1)$W^{k,2}_0(-1,1)$ into the space L1(−1,1)$L^1(-1,1)$ and determine the extremal functions. This improves on a previous estimate of the sharp constants of these embeddings due to Kalyabin.
Raul Hindov+3 more
wiley +1 more source
SPERNER THEOREMS FOR UNRELATED COPIES OF POSETS AND GENERATING DISTRIBUTIVE LATTICES
For a finite poset (partially ordered set) \(U\) and a natural number \(n\), let \(S(U,n)\) denote the largest number of pairwise unrelated copies of \(U\) in the powerset lattice (AKA subset lattice) of an \(n\)-element set.
Gábor Czédli
doaj +1 more source
Hypergraph removal lemmas via robust sharp threshold theorems
Hypergraph removal lemmas via robust sharp threshold theorems, Discrete Analysis 2020:10, 46 pp. A central result in additive and extremal combinatorics is the triangle removal lemma, which roughly speaking states that a graph with few triangles can be ...
Noam Lifshitz
doaj +1 more source
New extremal singly even self-dual codes of lengths $64$ and $66$ [PDF]
For lengths $64$ and $66$, we construct extremal singly even self-dual codes with weight enumerators for which no extremal singly even self-dual codes were previously known to exist. We also construct new $40$ inequivalent extremal doubly even self-dual $[64,32,12]$ codes with covering radius $12$ meeting the Delsarte bound.
arxiv +1 more source
Shattered Sets and the Hilbert Function [PDF]
We study complexity measures on subsets of the boolean hypercube and exhibit connections between algebra (the Hilbert function) and combinatorics (VC theory). These connections yield results in both directions.
Moran, Shay, Rashtchian, Cyrus
core +1 more source
Universality for transversal Hamilton cycles
Abstract Let G={G1,…,Gm}$\mathbf {G}=\lbrace G_1, \ldots, G_m\rbrace$ be a graph collection on a common vertex set V$V$ of size n$n$ such that δ(Gi)⩾(1+o(1))n/2$\delta (G_i) \geqslant (1+o(1))n/2$ for every i∈[m]$i \in [m]$. We show that G$\mathbf {G}$ contains every Hamilton cycle pattern.
Candida Bowtell+3 more
wiley +1 more source
f-vectors implying vertex decomposability [PDF]
We prove that if a pure simplicial complex of dimension d with n facets has the least possible number of (d-1)-dimensional faces among all complexes with n faces of dimension d, then it is vertex decomposable. This answers a question of J.
Lasoń, Michał
core +2 more sources