Zobrazeno 1 - 10
of 42
pro vyhledávání: '"N. M. Singhi"'
Autor:
Amitava Bhattacharya, N. M. Singhi
Publikováno v:
Discrete Applied Mathematics. 161:1180-1186
In this short survey, some approaches that can be used to solve the generalized (t,k)-design problem are considered. Special cases of the generalized (t,k)-design problem include well-known conjectures for t-designs, degree sequences of graphs and hy
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::be8d5c07f686c059c8a3d3eb793eedd8
https://doi.org/10.1016/j.dam.2012.03.011
https://doi.org/10.1016/j.dam.2012.03.011
Autor:
N. M. Singhi, D.K. Ray-Chaudhuri
Publikováno v:
Designs, Codes and Cryptography. 65:365-381
A new method to study families of finite sets, in particular t-designs, by studying families of multisets (also called lists) and their relationships with families of sets, is developed. Notion of the tag for a subset defined earlier by one of the au
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::414ecc905ab34b7153556e92338b9e21
https://doi.org/10.1007/s10623-012-9708-0
https://doi.org/10.1007/s10623-012-9708-0
Autor:
N. M. Singhi
Publikováno v:
European Journal of Combinatorics. 31(2):622-643
Semiadditive rings are defined and their relationship with the projective planes is studied. Free semiadditive rings provide an analogue of the ring of integers and polynomials for the ternary rings. A structure theory for free semiadditive rings is
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b3a9b9b1ea1b7cd55715f1863758691
Autor:
N. M. Singhi
Publikováno v:
Discrete Mathematics. 306:1610-1623
A new definition of a tag on a subset of a finite set is given. Tags were recently defined in a joint paper of the author and J.S. Chahal. The new definition considerably simplifies the concepts further. Relationship with lexicographic ordering is mu
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c26dd4754fea1e3dbac017b9599d676
https://doi.org/10.1016/j.disc.2005.06.037
https://doi.org/10.1016/j.disc.2005.06.037
Autor:
N. M. Singhi, K.S Vijayan
Publikováno v:
Journal of Statistical Planning and Inference. 95:3-7
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::a9da72dc3fee53451b60ed4ee8023922
https://doi.org/10.1016/s0378-3758(00)00275-5
https://doi.org/10.1016/s0378-3758(00)00275-5
Publikováno v:
Journal of Statistical Planning and Inference. 58:87-92
In this paper some further characterization of basic (v,k,t) trades (null t-designs) is presented. This includes the necessary and sufficient conditions for a given set of k-subsets to be a subset of a basic (v,k,t) trade.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9409690133fa60d664c627fda3d614e6
https://doi.org/10.1016/s0378-3758(96)00062-6
https://doi.org/10.1016/s0378-3758(96)00062-6
Autor:
N. M. Singhi, D. R. Hughes
Publikováno v:
European Journal of Combinatorics. 12:223-235
This paper introduces a generalization of association schemes, for arbitrary finite graphs, even for arbitrary square matrices. This serves several ends: it can help to find eigenvalues, it can decide whether a given graph is the graph of an associat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b1ab4001070b61afc750a97cf6502f74
https://doi.org/10.1016/s0195-6698(13)80088-1
https://doi.org/10.1016/s0195-6698(13)80088-1
Autor:
Stephan Foldes, N. M. Singhi
Publikováno v:
Electronic Notes in Discrete Mathematics. 27:27-28
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f5c3ce6d586a2df923ba90c37e038a18
https://doi.org/10.1016/j.endm.2006.08.040
https://doi.org/10.1016/j.endm.2006.08.040
Publikováno v:
Coding Theory and Design Theory ISBN: 9781461389965
A concept of P-independent sets is defined for Z-modules or convex sets. P- independence gives a convex analogue of usual independence. It is used for codes. A quasipolynomial type theorem is proved for the number of inequivalent codes with a given d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ff14edf9c7b6af40a607813e1d484939
https://doi.org/10.1007/978-1-4613-8994-1_8
https://doi.org/10.1007/978-1-4613-8994-1_8
Autor:
N. M. Singhi, G. R. Vijayakumar
Publikováno v:
Coding Theory and Design Theory ISBN: 9781461389965
A survey of some results concerning the class of sigraphs represented by root-systems D n, n ∈ N and E 8 is given and some unsolved problems are described.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b9e2d0508061b38b1b88a3498291ab58
https://doi.org/10.1007/978-1-4613-8994-1_16
https://doi.org/10.1007/978-1-4613-8994-1_16