Results 11 to 20 of about 1,601 (139)
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
Clinical Pharmacology &Therapeutics, Volume 119, Issue 4, Page 1005-1015, April 2026.Straight to Phase III: Model‐informed approach speeds depemokimab clinical development in interleukin‐5‐driven diseases. IL‐5, a key mediator of type 2 inflammation, underlies various diseases, including severe asthma, CRSwNP, EGPA, and HES. Reduction in blood eosinophil count (BEC), a biomarker of IL‐5 activity, is commonly used to evaluate the ...
Chiara Zecchin +6 more
wiley +1 more source
A Study On Combinatorics Indiscrete Mathematics
, 2018 {"references": ["1.\tArumugam. S & Isaac. A. T, \"Modern Algebra\", Scitech Publications Pvt. Ltd, Chennai. 2.\tLiu. C. L \"Elements of Discrete Mathematics\", MC Graw Hill, Internation Edition. 3.\tTremblay. J. P & Manohar. R, \"Discrete Mathematics Structure with application to computer science\", TMH Edition 1007. 4.\tVeerarajan.
G. Rajkumar, Dr. V. Ramadoss
openaire +1 more source
Recursive and Cyclic Constructions for Double‐Change Covering Designs
Journal of Combinatorial Designs, Volume 34, Issue 4, Page 198-209, April 2026.ABSTRACT A double‐change covering design (DCCD) is a v‐set V and an ordered list L of b blocks of size k where every pair from V must occur in at least one block and each pair of consecutive blocks differs by exactly two elements. It is minimal if it has the fewest blocks possible and circular when the first and last blocks also differ by two elements.
Amanda Lynn Chafee, Brett Stevens
wiley +1 more source
Subsquares in Random Latin Squares and Rectangles
Journal of Combinatorial Designs, Volume 34, Issue 4, Page 184-197, April 2026.ABSTRACT A k × n partial Latin rectangle is C ‐ sparse if the number of nonempty entries in each row and column is at most C and each symbol is used at most C times. We prove that the probability a uniformly random k × n Latin rectangle, where k < ( 1 ∕ 2 − α ) n, contains a β n‐sparse partial Latin rectangle with ℓ nonempty entries is 1 ± ε n ℓ for ...
Alexander Divoux +3 more
wiley +1 more source
Hypergraphs with arbitrarily small codegree Turán density
Bulletin of the London Mathematical Society, Volume 58, Issue 4, April 2026.Abstract The codegree Turán density γ(F)$\gamma (F)$ of a k$k$‐graph F$F$ is the smallest γ∈[0,1)$\gamma \in [0,1)$ such that every k$k$‐graph H$H$ with δk−1(H)⩾(γ+o(1))|V(H)|$\delta _{k-1}(H)\geqslant (\gamma +o(1))\vert V(H)\vert$ contains a copy of F$F$. In this work, we show that for every ε>0$\varepsilon >0$, there is a k$k$‐uniform hypergraph F$F$
Simón Piga, Bjarne Schülke
wiley +1 more source
Some bounds related to the 2‐adic Littlewood conjecture
Mathematika, Volume 72, Issue 2, April 2026.Abstract For every irrational real α$\alpha$, let M(α)=supn⩾1an(α)$M(\alpha) = \sup _{n\geqslant 1} a_n(\alpha)$ denote the largest partial quotient in its continued fraction expansion (or ∞$\infty$, if unbounded). The 2‐adic Littlewood conjecture (2LC) can be stated as follows: There exists no irrational α$\alpha$ such that M(2kα)$M(2^k \alpha)$ is ...
Dinis Vitorino, Ingrid Vukusic
wiley +1 more source
Non‐vanishing of Poincaré series on average
Mathematika, Volume 72, Issue 2, April 2026.Abstract We study when Poincaré series for congruence subgroups do not vanish identically. We show that almost all Poincaré series with suitable parameters do not vanish when either the weight k$k$ or the index m$m$ varies in a dyadic interval. Crucially, analyzing the problem ‘on average’ over these weights or indices allows us to prove non‐vanishing ...
Ned Carmichael, Noam Kimmel
wiley +1 more source
International Journal Of Mathematical Combinatorics
, 2015 The International J.Mathematical Combinatorics (ISSN 1937-1055) is a fully refereed international journal, sponsored by the MADIS of Chinese Academy of Sciences and published in USA quarterly comprising 100-150 pages approx. per volume, which publishes original research papers and survey articles in all aspects of Smarandachemulti-spaces, Smarandache ...
openaire +1 more source
Discrepancy of arithmetic progressions in boxes and convex bodies
Mathematika, Volume 72, Issue 2, April 2026.Abstract The combinatorial discrepancy of arithmetic progressions inside [N]:={1,…,N}$[N]:= \lbrace 1, \ldots, N\rbrace$ is the smallest integer D$D$ for which [N]$[N]$ can be colored with two colors so that any arithmetic progression in [N]$[N]$ contains at most D$D$ more elements from one color class than the other.
Lily Li, Aleksandar Nikolov
wiley +1 more source