Relevant bibliographies by topics / Combinatorics of cores

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Books
  4. Book chapters
  5. Conference papers
  6. Reports

Academic literature on the topic 'Combinatorics of cores'

Author: Grafiati
Published: 5 October 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Combinatorics of cores.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Combinatorics of cores"

1

Aukerman, David, Ben Kane, and Lawrence Sze. "On simultaneous s-cores/t-cores." Discrete Mathematics 309, no. 9 (2009): 2712–20. http://dx.doi.org/10.1016/j.disc.2008.06.024.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Godsil, Chris, and Gordon F. Royle. "Cores of Geometric Graphs." Annals of Combinatorics 15, no. 2 (2011): 267–76. http://dx.doi.org/10.1007/s00026-011-0094-5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Mančinska, Laura, Irene Pivotto, David E. Roberson, and Gordon F. Royle. "Cores of cubelike graphs." European Journal of Combinatorics 87 (June 2020): 103092. http://dx.doi.org/10.1016/j.ejc.2020.103092.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Han, Guo-Niu, and Ken Ono. "Hook Lengths and 3-Cores." Annals of Combinatorics 15, no. 2 (2011): 305–12. http://dx.doi.org/10.1007/s00026-011-0096-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Sato, Cristiane M. "On the robustness of randomk-cores." European Journal of Combinatorics 41 (October 2014): 163–82. http://dx.doi.org/10.1016/j.ejc.2014.03.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Malen, Greg. "Homomorphism complexes andk-cores." Discrete Mathematics 341, no. 9 (2018): 2567–74. http://dx.doi.org/10.1016/j.disc.2018.06.014.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Cho, Hyunsoo, and Kyounghwan Hong. "Corners of self-conjugate (s,s + 1)-cores and (s‾,s+1‾)-cores." Discrete Mathematics 345, no. 9 (2022): 112949. http://dx.doi.org/10.1016/j.disc.2022.112949.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Baruah, Nayandeep Deka, and Kallol Nath. "Infinite families of arithmetic identities for self-conjugate 5-cores and 7-cores." Discrete Mathematics 321 (April 2014): 57–67. http://dx.doi.org/10.1016/j.disc.2013.12.019.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Thiel, Marko, and Nathan Williams. "Strange expectations and simultaneous cores." Journal of Algebraic Combinatorics 46, no. 1 (2017): 219–61. http://dx.doi.org/10.1007/s10801-017-0754-6.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Kotsireas, Ilias S., Christos Koukouvinos, and Jennifer Seberry. "Hadamard ideals and Hadamard matrices with two circulant cores." European Journal of Combinatorics 27, no. 5 (2006): 658–68. http://dx.doi.org/10.1016/j.ejc.2005.03.004.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Combinatorics of cores"

1

Stockwell, Roger James. "Frameproof codes : combinatorial properties and constructions." Thesis, Royal Holloway, University of London, 2003. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.405211.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Houghten, Sheridan. "On combinatorial searches for designs and codes." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0016/NQ43587.pdf.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Phillips, Linzy. "Erasure-correcting codes derived from Sudoku & related combinatorial structures." Thesis, University of South Wales, 2013. https://pure.southwales.ac.uk/en/studentthesis/erasurecorrecting-codes-derived-from-sudoku--related-combinatorial-structures(b359130e-bfc2-4df0-a6f5-55879212010d).html.

Full text
Abstract:
This thesis presents the results of an investigation into the use of puzzle-based combinatorial structures for erasure correction purposes. The research encompasses two main combinatorial structures: the well-known number placement puzzle Sudoku and a novel three component construction designed specifically with puzzle-based erasure correction in mind. The thesis describes the construction of outline erasure correction schemes incorporating each of the two structures. The research identifies that both of the structures contain a number of smaller sub-structures, the removal of which results in
APA, Harvard, Vancouver, ISO, and other styles
4

Esterle, Alexandre. "Groupes d'Artin et algèbres de Hecke sur un corps fini." Thesis, Amiens, 2018. http://www.theses.fr/2018AMIE0061/document.

Full text
Abstract:
Nous déterminons dans cette thèse l'image des groupes de Artin associés à des groupes de Coxeter irréductibles dans leur algèbre de Iwahori-Hecke finie associée. Cela a été fait en type A dans des articles de Brunat, Marin et Magaard. Dans le cas générique, la clôture de l'image de Zariski a été déterminée dans tous les cas par Marin. L'approximation forte suggère que les résultats devraient être similaire dans le cas fini. Il est néanmoins impossible d'utiliser l'approximation forte sans utiliser de lourdes hypothèses et limiter l'étendue des résultats. Nous démontrons dans cette thèse que le
APA, Harvard, Vancouver, ISO, and other styles
5

Paegelow, Raphaël. "Action des sous-groupes finis de SL2(C) sur la variété de carquois de Nakajima du carquois de Jordan et fibrés de Procesi." Electronic Thesis or Diss., Université de Montpellier (2022-....), 2024. http://www.theses.fr/2024UMONS005.

Full text
Abstract:
Dans cette thèse de doctorat, nous avons, dans un premier temps, étudié la décomposition en composantes irréductibles du lieu des points fixes sous l’action d’un sous-groupe fini Γ de SL2(C) de la variété de carquois de Nakajima du carquois de Jordan. La variété de carquois associé au carquois de Jordan est isomorphe soit au schéma ponctuel de Hilbert dans C2 soit à l’espace de Calogero-Moser. Nous avons décrit ces composantes irréductibles à l’aide de variétés de carquois du carquois de McKay associé au sous-groupe fini Γ. Nous nous sommes ensuite intéressés à la combinatoire découlant de l’e
APA, Harvard, Vancouver, ISO, and other styles
6

Paris, Gabrielle. "Resolution of some optimisation problems on graphs and combinatorial games." Thesis, Lyon, 2018. http://www.theses.fr/2018LYSE1180/document.

Full text
Abstract:
J'ai étudié trois problèmes d'optimisation dans les graphes et les jeux combinatoires.Tout d'abord, les codes identifiants dans les graphes où les sommets font faces à des failles: les codes cherchent à repérer les failles pour les réparer. On s'est intéressé aux codes identifiants dans les graphes circulants en utilisant des plongements de ces graphes dans des grilles infinies.Ensuite, j'ai étudié le jeu de marquage de sommets et le jeu de coloration d'arêtes: ici deux joueurs se font face, le premier cherche à construire une coloration correcte (ou un marquage correct) et le deuxième cherche
APA, Harvard, Vancouver, ISO, and other styles
7

Chen, Lei. "Construction of structured low-density parity-check codes : combinatorial and algebraic approaches /." For electronic version search Digital dissertations database. Restricted to UC campuses. Access is free to UC campus dissertations, 2005. http://uclibs.org/PID/11984.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Vandomme, Elise. "Contributions to combinatorics on words in an abelian context and covering problems in graphs." Thesis, Université Grenoble Alpes (ComUE), 2015. http://www.theses.fr/2015GRENM010/document.

Full text
Abstract:
Cette dissertation se divise en deux parties, distinctes mais connexes, qui sont le reflet de la cotutelle. Nous étudions et résolvons des problèmes concernant d'une part la combinatoire des mots dans un contexte abélien et d'autre part des problèmes de couverture dans des graphes. Chaque question fait l'objet d'un chapitre. En combinatoire des mots, le premier problème considéré s'intéresse à la régularité des suites au sens défini par Allouche et Shallit. Nous montrons qu'une suite qui satisfait une certaine propriété de symétrie est 2-régulière. Ensuite, nous appliquons ce théorème pour mon
APA, Harvard, Vancouver, ISO, and other styles
9

Larico, Mullisaca Celso Ever. "Un Algoritmo GRASP-Reactivo para resolver el problema de cortes 1D." Bachelor's thesis, Universidad Nacional Mayor de San Marcos, 2010. https://hdl.handle.net/20.500.12672/2649.

Full text
Abstract:
Se tiene un grupo de requerimientos de piezas con una cantidad ilimitada de barras de algún tipo de material de tamaño estándar y éste posee mayor dimensión que el grupo de requerimientos. El problema de cortes 1D describe la utilización de las barras de tamaño estándar realizando cortes sobre ellas, de manera que se satisfaga todos los requerimientos con el menor número de barras de tamaño estándar. El problema es catalogado como NP-Difícil [Garey+79], y es ampliamente aplicado en diversos sectores de la industria tales como la maderera, vidrio, papelera, siderúrgica, etc. La presente tesis
APA, Harvard, Vancouver, ISO, and other styles
10

Passuello, Alberto. "Semidefinite programming in combinatorial optimization with applications to coding theory and geometry." Phd thesis, Université Sciences et Technologies - Bordeaux I, 2013. http://tel.archives-ouvertes.fr/tel-00948055.

Full text
Abstract:
We apply the semidefinite programming method to obtain a new upper bound on the cardinality of codes made of subspaces of a linear vector space over a finite field. Such codes are of interest in network coding.Next, with the same method, we prove an upper bound on the cardinality of sets avoiding one distance in the Johnson space, which is essentially Schrijver semidefinite program. This bound is used to improve existing results on the measurable chromatic number of the Euclidean space.We build a new hierarchy of semidefinite programs whose optimal values give upper bounds on the independence
APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Combinatorics of cores"

1

1951-, Cohen G., ed. Covering codes. Elsevier, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

Tonchev, Vladimir. Combinatorial configurations: Designs, codes, graphs. Longman Scientific & Technical, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

Tonchev, Vladimir D. Combinatorial configurations: Designs, codes, graphs. Longman Scientific & Technical, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

Vladimir, Tonchev, ed. Codes, designs, and geometry. Kluwer Academic Pub., 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

Gerardus Joannes Maria Van Wee. Covering codes, perfect codes, and codes from algebraic curves. Wibro Dissertatiedrukkerij, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Beth, Thomas, and Michael Clausen, eds. Applicable Algebra, Error-Correcting Codes, Combinatorics and Computer Algebra. Springer Berlin Heidelberg, 1988. http://dx.doi.org/10.1007/bfb0039172.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

1949-, Beth Thomas, and Clausen Michael, eds. Applicable algebra, error-correcting codes, combinatorics and computer algebra: Proceedings. Springer-Verlag, 1988.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

D, Key J., ed. Designs and their codes. Cambridge University Press, 1992.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Victor, Zinoviev, ed. Codes on Euclidean spheres. Elsevier, 2001.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

Tonchev, Vladimir. Codes, Designs and Geometry. Springer US, 1996.

Find full text
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Combinatorics of cores"

1

Jukna, Stasys. "Combinatorics of Codes." In Texts in Theoretical Computer Science. An EATCS Series. Springer Berlin Heidelberg, 2011. http://dx.doi.org/10.1007/978-3-642-17364-6_17.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Shokrollahi, Amin. "LDPC Codes: An Introduction." In Coding, Cryptography and Combinatorics. Birkhäuser Basel, 2004. http://dx.doi.org/10.1007/978-3-0348-7865-4_5.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ahmed, Maya, Jesús De Loera, and Raymond Hemmecke. "Polyhedral Cones of Magic Cubes and Squares." In Algorithms and Combinatorics. Springer Berlin Heidelberg, 2003. http://dx.doi.org/10.1007/978-3-642-55566-4_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rehfinger, Thomas, N. Suresh Babu, and Karl-Heinz Zimmermann. "New Good Codes via CQuest — A System for the Silicon Search of Linear Codes." In Algebraic Combinatorics and Applications. Springer Berlin Heidelberg, 2001. http://dx.doi.org/10.1007/978-3-642-59448-9_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Li, Lei, and Shoulun Long. "New Constructions of Constant-Weight Codes." In Coding, Cryptography and Combinatorics. Birkhäuser Basel, 2004. http://dx.doi.org/10.1007/978-3-0348-7865-4_13.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Sheekey, John. "13. MRD codes: constructions and connections." In Combinatorics and Finite Fields, edited by Kai-Uwe Schmidt and Arne Winterhof. De Gruyter, 2019. http://dx.doi.org/10.1515/9783110642094-013.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Patrou, Bruno. "Zigzag codes and z-free hulls." In Combinatorics and Computer Science. Springer Berlin Heidelberg, 1996. http://dx.doi.org/10.1007/3-540-61576-8_88.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Guo, Yuqi, Yun Liu, and Shoufeng Wang. "Some Common-Used Codes." In Topics on Combinatorial Semigroups. Springer Nature Singapore, 2024. http://dx.doi.org/10.1007/978-981-99-9171-6_2.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Solé, Patrick. "Covering codes and combinatorial optimization." In Applied Algebra, Algebraic Algorithms and Error-Correcting Codes. Springer Berlin Heidelberg, 1991. http://dx.doi.org/10.1007/3-540-54522-0_130.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Giulietti, Massimo, Arianna Sabatini, and Marco Timpanella. "PIR Codes from Combinatorial Structures." In Arithmetic of Finite Fields. Springer International Publishing, 2023. http://dx.doi.org/10.1007/978-3-031-22944-2_10.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Combinatorics of cores"

1

Sabary, Omer, Inbal Preuss, Ryan Gabrys, Zohar Yakhini, Leon Anavy, and Eitan Yaakobi. "Error-Correcting Codes for Combinatorial Composite DNA." In 2024 IEEE International Symposium on Information Theory (ISIT). IEEE, 2024. http://dx.doi.org/10.1109/isit57864.2024.10619334.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Aydin, Nuh, Thomas Guidotti, and Peihan Liu. "New Linear Codes as Quasi-Twisted Codes from Long Constacyclic Codes." In 2020 Algebraic and Combinatorial Coding Theory (ACCT). IEEE, 2020. http://dx.doi.org/10.1109/acct51235.2020.9383237.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Aggarwal, Divesh, Yevgeniy Dodis, and Shachar Lovett. "Non-malleable codes from additive combinatorics." In STOC '14: Symposium on Theory of Computing. ACM, 2014. http://dx.doi.org/10.1145/2591796.2591804.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Rousseva, Assia, and Ivan Landjev. "Codes related to caps and the non-existence of some Griesmer codes." In 2020 Algebraic and Combinatorial Coding Theory (ACCT). IEEE, 2020. http://dx.doi.org/10.1109/acct51235.2020.9383359.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Chee, Yeow Meng, Fei Gao, Samuel Tien Ho Teo, and Hui Zhang. "Combinatorial systematic switch codes." In 2015 IEEE International Symposium on Information Theory (ISIT). IEEE, 2015. http://dx.doi.org/10.1109/isit.2015.7282453.

Full text
APA, Harvard, Vancouver, ISO, and other styles
6

Zhang, Hui, Eitan Yaakobi, and Natalia Silberstein. "Multiset combinatorial batch codes." In 2017 IEEE International Symposium on Information Theory (ISIT). IEEE, 2017. http://dx.doi.org/10.1109/isit.2017.8006916.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Verma, Ram Krishna, Om Prakash, and Ashutosh Singh. "Quantum codes from skew constacyclic codes over Fp m + vFp m + v2Fp m." In 2020 Algebraic and Combinatorial Coding Theory (ACCT). IEEE, 2020. http://dx.doi.org/10.1109/acct51235.2020.9383402.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

Sidorenko, Vladimir, Wenhui Li, and Gerhard Kramer. "On interleaved rank metric codes." In 2020 Algebraic and Combinatorial Coding Theory (ACCT). IEEE, 2020. http://dx.doi.org/10.1109/acct51235.2020.9383406.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Daskalov, Rumen, and Elena Metodieva. "New QC Codes over GF(11)." In 2020 Algebraic and Combinatorial Coding Theory (ACCT). IEEE, 2020. http://dx.doi.org/10.1109/acct51235.2020.9383337.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Boyvalenkov, P., K. Delchev, D. V. Zinoviev, and V. A. Zinoviev. "On two-weight (linear and nonlinear) codes." In 2020 Algebraic and Combinatorial Coding Theory (ACCT). IEEE, 2020. http://dx.doi.org/10.1109/acct51235.2020.9383353.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Combinatorics of cores"

1

Altstein, Miriam, and Ronald J. Nachman. Rational Design of Insect Control Agent Prototypes Based on Pyrokinin/PBAN Neuropeptide Antagonists. United States Department of Agriculture, 2013. http://dx.doi.org/10.32747/2013.7593398.bard.

Full text
Abstract:
The general objective of this study was to develop rationally designed mimetic antagonists (and agonists) of the PK/PBAN Np class with enhanced bio-stability and bioavailability as prototypes for effective and environmentally friendly pest insect management agents. The PK/PBAN family is a multifunctional group of Nps that mediates key functions in insects (sex pheromone biosynthesis, cuticular melanization, myotropic activity, diapause and pupal development) and is, therefore, of high scientific and applied interest. The objectives of the current study were: (i) to identify an antagonist bioph
APA, Harvard, Vancouver, ISO, and other styles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography