Results 31 to 40 of about 125 (122)
Gowers norms for automatic sequences
Discrete Analysis, 2023 Gowers norms for automatic sequences, Discrete Analysis 2023:4, 62 pp. There are several situations in additive and extremal combinatorics where it is useful to decompose an object $X$ into a "structured" part $S(X)$ and a "quasirandom" part $Q(X)$.
Jakub Byszewski +2 more
doaj +1 more source
Spaceborne and spaceborn: Physiological aspects of pregnancy and birth during interplanetary flight
Experimental Physiology, EarlyView.Abstract Crewed interplanetary return missions that are on the planning horizon will take years, more than enough time for initiation and completion of a pregnancy. Pregnancy is viewed as a sequence of processes – fertilization, blastocyst formation, implantation, gastrulation, placentation, organogenesis, gross morphogenesis, birth and neonatal ...
Arun V. Holden
wiley +1 more source
Further results on permanents of Laplacian matrices of trees
Open MathematicsThe research on the permanents of graph matrices is one of the contemporary research topic in algebraic combinatorics. Brualdi and Goldwasser characterized the upper and lower bounds of permanents of Laplacian matrices of trees.
Wu Tingzeng, Dong Xiangshuai
doaj +1 more source
Discrete Analysis, 2020 An efficient container lemma, Discrete Analysis 2020:17, 56 pp. The hypergraph container lemma, discovered independently in 2012 by David Saxton and Andrew Thomason, and by József Balogh, Robert Morris and Wojciech Samotij, is an extremely powerful tool
Jozsef Balogh, Wojciech Samotij
doaj +1 more source
On Regular Quaternary Hadamard Matrices
Journal of Combinatorial Designs, Volume 34, Issue 5, Page 215-227, May 2026.ABSTRACT Through the use of regularizing vectors, all regular quaternary Hadamard matrices of orders 10 and 18 have been successfully identified. Of these, two matrices of order 10 and 184 matrices of order 18 were found to have unbiased mates. Converting the quaternary Hadamard matrices of order 18 to real Hadamard matrices, the study uncovered that ...
Hadi Kharaghani +2 more
wiley +1 more source
Variants of a theorem of Macbeath in finite‐dimensional normed spaces
Mathematika, Volume 72, Issue 2, April 2026.Abstract A classical theorem of Macbeath states that for any integers d⩾2$d \geqslant 2$, n⩾d+1$n \geqslant d+1$, d$d$‐dimensional Euclidean balls are hardest to approximate, in terms of volume difference, by inscribed convex polytopes with n$n$ vertices.
Zsolt Lángi, Shanshan Wang
wiley +1 more source
Extremal, enumerative and probabilistic results on ordered hypergraph matchings
Forum of Mathematics, SigmaAn ordered r-matching is an r-uniform hypergraph matching equipped with an ordering on its vertices. These objects can be viewed as natural generalisations of r-dimensional orders.
Michael Anastos +3 more
doaj +1 more source
Simple juntas for shifted families
Discrete Analysis, 2020 **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
Random Structures &Algorithms, Volume 68, Issue 2, March 2026.ABSTRACT Let G$$ G $$ be a Dirac graph, and let S$$ S $$ be a vertex subset of G$$ G $$, chosen uniformly at random. How likely is the induced subgraph G[S]$$ G\left[S\right] $$ to be Hamiltonian? This question, proposed by Erdős and Faudree in 1996, was recently resolved by Draganić, Keevash, and Müyesser, in the setting of graphs.
Zach Hunter +3 more
wiley +1 more source
Two problems in extremal combinatorics
, 2021 In this thesis, we focus on two problems in extremal graph theory. Extremal graph theory consists of all problems related to optimizing parameters defined on graphs. The concept of ``editing'' appears in many key results and techniques in extremal graph theory, either as a means to account for error in structural results, or as a quantity to minimize ...
openaire +4 more sources