نتایج جستجو برای: parity conjecture

تعداد نتایج: 62331  

Journal: :iranian journal of applied animal science 2015
s. naghshineh s.a. rafat j. shoja g.a. moghaddam m. ebrahimi

the present study aimed to estimate the effects of parity, calving season and year of calving on the prevalence of subclinical mastitis in holstein cows. a total of 2682 records from 869 holstein cows in a large dairy farm (azarbaijan province, iran), respecting the period from 2006 to 2009, were collected. data was analyzed using proc mixed of sas software by mivque method. subclinical mastiti...

Journal: :Journal de Theorie des Nombres de Bordeaux 2023

Behind this sophisticated title hides an elementary exercise on Clifford theory for index two subgroups and self-dual or conjugate-dual representations. When applied to semi-simple representations of the Weil–Deligne group W F ′ a non Archimedean local field F, further translated in terms GL n (F) via Langlands correspondence when has characteristic zero, it yields various statements concerning...

1999
Olivier Baudon Guillaume Fertin Ivan Havel

Olivier Baudon y, Guillaume Fertin y and Ivan Havel z y LaBRI U.M.R. CNRS 5800, Universit e Bordeaux I 351 Cours de la Lib eration, F33405 Talence Cedex z Faculty of Mathematics and Physics, Charles University Malostransk e n am. 25, 118 00 Praha, Czech Republic fbaudon,[email protected], [email protected] Abstract We study an n-dimensional directed symmetric hypercube Hn, in which e...

Journal: :J. Comb. Theory, Ser. B 2002
James F. Geelen Geoff Whittle

We begin by giving some background to this result. A matroid M is an excluded minor for a minor-closed class of matroids if M is not in the class but all proper minors of M are. It is natural to attempt to characterize a minor-closed class of matroids by giving a complete list of its excluded minors. Unfortunately, a minor-closed class of matroids can have an infinite number of excluded minors....

Journal: :Proceedings of the Japan Academy, Series A, Mathematical Sciences 2000

Journal: :transactions on combinatorics 2015
pankaj kumar das

the paper presents lower and upper bounds on the number of parity check digits required for a linear code that detects solid bursts of length $b$ or less and simultaneously any $e$ or less random errors. an example of such a code is also provided. further, codes capable of detecting and simultaneously correcting such errors have also been dealt with.

Journal: :iranian journal of cancer prevention 0
a akbari shahid beheshti university of medical sciences, cancer research center, tehran, iran ar hadi shahid beheshti university of medical sciences, cancer research center, tehran, iran a akhavan tabib shahid beheshti university of medical sciences, cancer research center, tehran, iran ar majd shahid beheshti university of medical sciences, cancer research center, tehran, iran z razaghi shahid beheshti university of medical sciences, cancer research center, tehran, iran mm esfahani shahid beheshti university of medical sciences, cancer research center, tehran, iran

background: in some verses in holy quran; 233 surat al-baghare , 15 al-ahghaf , 14 loghman and 6 al-talagh, breastfeeding, gravidity, and parity recommended to the parents and expected their children to be accountable to the parents; particularly to mothers due to tolerate of pregnancy and breastfeeding duration. methods: the case-control study included 376 patients diagnosed between      2001-...

Journal: :Discrete Applied Mathematics 2023

A graph G admitting a 2-factor is pseudo isomorphic if the parity of number cycles in all its 2-factors same. In Abreu et al. (2008) some authors this note gave partial characterisation bipartite cubic graphs and conjectured that K3,3, Heawood Pappus are only essentially 4-edge-connected ones. Goedgebeur (2015) Jan computationally found on 30 vertices which bipartite, cyclically 6-edge-connecte...

Journal: :European Journal of Combinatorics 2022

Let $p_{o}(n)$ (resp. $p_{e}(n)$) denote the number of partitions $n$ with more odd parts even parts) than parts). Recently, Kim, and Lovejoy proved that $p_{o}(n)>p_{e}(n)$ for all $n>2$ conjectured $d_{o}(n)>d_{e}(n)$ $n>19$ where $d_{o}(n)$ $d_{e}(n)$) into distinct having In this paper we provide combinatorial proofs both result conjecture Kim Lovejoy. addition, show if restrict smallest pa...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید