Log in

Relevant bibliographies by topics / Combinatorial objects

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers
Reports

Academic literature on the topic 'Combinatorial objects'

Author: Grafiati

Published: 4 June 2021

Last updated: 2 February 2022

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 'Combinatorial objects.'

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 "Combinatorial objects"

1

Kulkarni, V. G. "Generating random combinatorial objects." Journal of Algorithms 11, no. 2 (1990): 185–207. http://dx.doi.org/10.1016/0196-6774(90)90002-v.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Stojmenovic, Ivan. "Listing combinatorial objects in parallel." International Journal of Parallel, Emergent and Distributed Systems 21, no. 2 (2006): 127–46. http://dx.doi.org/10.1080/17445760500355777.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Brand, Neal. "Isomorphisms of cyclic combinatorial objects." Discrete Mathematics 78, no. 1-2 (1989): 73–81. http://dx.doi.org/10.1016/0012-365x(89)90162-3.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Brand, Neal. "Polynomial isomorphisms of combinatorial objects." Graphs and Combinatorics 7, no. 1 (1991): 7–14. http://dx.doi.org/10.1007/bf01789458.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Baralic, Djordje, Jelena Grbic, Ivan Limonchenko, and Aleksandar Vucic. "Toric objects associated with the dodecahedron." Filomat 34, no. 7 (2020): 2329–56. http://dx.doi.org/10.2298/fil2007329b.

Full text

Abstract:

In this paper we illustrate a tight interplay between homotopy theory and combinatorics within toric topology by explicitly calculating homotopy and combinatorial invariants of toric objects associated with the dodecahedron. In particular, we calculate the cohomology ring of the (complex and real) moment-angle manifolds over the dodecahedron, and of a certain quasitoric manifold and of a related small cover. We finish by studying Massey products in the cohomology ring of moment-angle manifolds over the dodecahedron and how the existence of nontrivial Massey products influences the behaviour of

APA, Harvard, Vancouver, ISO, and other styles

6

Coregliano, L. N., and A. A. Razborov. "Semantic limits of dense combinatorial objects." Russian Mathematical Surveys 75, no. 4 (2020): 627–723. http://dx.doi.org/10.1070/rm9956.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Beissinger, Janet Simpson. "The enumeration of irreducible combinatorial objects." Journal of Combinatorial Theory, Series A 38, no. 2 (1985): 143–69. http://dx.doi.org/10.1016/0097-3165(85)90065-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Cantwell, Amelia, Juliann Geraci, Anant Godbole, and Cristobal Padilla. "Graph universal cycles of combinatorial objects." Advances in Applied Mathematics 127 (June 2021): 102166. http://dx.doi.org/10.1016/j.aam.2021.102166.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ďuriš, Viliam, Gabriela Pavlovičová, Dalibor Gonda, and Anna Tirpáková. "Teaching Combinatorial Principles Using Relations through the Placemat Method." Mathematics 9, no. 15 (2021): 1825. http://dx.doi.org/10.3390/math9151825.

Full text

Abstract:

The presented paper is devoted to an innovative way of teaching mathematics, specifically the subject combinatorics in high schools. This is because combinatorics is closely connected with the beginnings of informatics and several other scientific disciplines such as graph theory and complexity theory. It is important in solving many practical tasks that require the compilation of an object with certain properties, proves the existence or non-existence of some properties, or specifies the number of objects of certain properties. This paper examines the basic combinatorial structures and presen

APA, Harvard, Vancouver, ISO, and other styles

10

Tymofijeva, Nadija. "Combinatorial configurations, fractals, fractal dimension of combinatorial sets." Physico-mathematical modelling and informational technologies, no. 33 (September 6, 2021): 170–74. http://dx.doi.org/10.15407/fmmit2021.33.170.

Full text

Abstract:

Combinatorial configurations and their sets are considered. The definitions of these objects are given, recurrent combinatorial operators are introduced, with the help of which they are formed, and rules are formulated according to which their sets are ordered. The property of periodicity, which takes place in the generation of combinatorial configurations, is described. It follows from the recurrent way of their formation and ordering. The fractal structure of combinatorial sets is formed due to the described rules, in which the property of periodicity is used. Analysis of these structures sh

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Combinatorial objects"

1

Campbell, Andre A. "Universal Cycles for Some Combinatorial Objects." Digital Commons @ East Tennessee State University, 2013. https://dc.etsu.edu/etd/1130.

Full text

Abstract:

A de Bruijn cycle commonly referred to as a universal cycle (u-cycle), is a complete and compact listing of a collection of combinatorial objects. In this paper, we show the power of de Bruijn's original theorem, namely that the cycles bearing his name exist for n-letter words on a k-letter alphabet for all values of k,n, to prove that we can create de Bruijn cycles for multi-sets using natural encodings and M-Lipschitz n-letter words and the assignment of elements of [n]={1,2,...,n} to the sets in any labeled subposet of the Boolean lattice; de Bruijn's theorem corresponds to the case when th

APA, Harvard, Vancouver, ISO, and other styles

2

Duchi, Enrica. "ECO method and object grammars : two methods for the enumeration of combinatorial objects." Nice, 2003. http://www.theses.fr/2003NICE4010.

Full text

Abstract:

Cette thèse se situe dans le domaine de la combinatoire énumérative et bijective. La thèse commence par une introduction sur les structures et les méthodes qui sont ensuite utilisées. Puis elle se divise en deux parties. La première analyse des problèmes liés à ECO. En particulier, on analyse le problème de monter des règles de succession équivalentes. Plus précisément, on introduit des classes de règles équivalentes et on démontre l’équivalence en utilisant la méthode ECO. Dans le chapitre 3, on montre comment déterminer des règles de succession associées à une grande classe de récurrences li

APA, Harvard, Vancouver, ISO, and other styles

3

Blin, Guillaume. "Combinatorial Objects in Bio-Algorithmics: Related problems and complexities." Habilitation à diriger des recherches, Université Paris-Est, 2012. http://tel.archives-ouvertes.fr/tel-00711879.

Full text

Abstract:

The aim of this habilitation is to exhibit my contributions in several area of Bio-Algorithmics. Rather than an exhaustive presentation of my works, I have made the choice of presenting results we obtained with collaborators on a representative subset of the problems I have been involved in since 2005. For ease of readability, I will regroup the results obtained according to the biological problems: i) RNA structures comparison, ii) Genomes comparison and iii) Pattern matching in biological networks and their respective combinatorial objects: i) Arc-annotated sequences, ii) Permutations and Se

APA, Harvard, Vancouver, ISO, and other styles

4

Miracle, Sarah. "The effects of bias on sampling algorithms and combinatorial objects." Diss., Georgia Institute of Technology, 2015. http://hdl.handle.net/1853/53526.

Full text

Abstract:

Markov chains are algorithms that can provide critical information from exponentially large sets efficiently through random sampling. These algorithms are ubiquitous across numerous scientific and engineering disciplines, including statistical physics, biology and operations research. In this thesis we solve sampling problems at the interface of theoretical computer science with applied computer science, discrete mathematics, statistical physics, chemistry and economics. A common theme throughout each of these problems is the use of bias. The first problem we study is biased permutations

APA, Harvard, Vancouver, ISO, and other styles

5

Arafailova, Ekaterina. "Functional description of sequence constraints and synthesis of combinatorial objects." Thesis, Ecole nationale supérieure Mines-Télécom Atlantique Bretagne Pays de la Loire, 2018. http://www.theses.fr/2018IMTA0089/document.

Full text

Abstract:

A l’opposé de l’approche consistant à concevoir aucas par cas des contraintes et des algorithmes leur étant dédiés, l’objet de cette thèse concerne d’une part la description de familles de contraintes en termes de composition de fonctions, et d’autre part la synthèse d’objets combinatoires pour de telles contraintes. Les objets concernés sont des bornes précises, des coupes linéaires, des invariants non-linéaires et des automates finis ; leur but principal est de prendre en compte l’aspect combinatoire d’une seule contrainte ou d’une conjonction de contraintes. Ces objets sont obtenus d’une fa

APA, Harvard, Vancouver, ISO, and other styles

6

Eberhard, Sean. "Some combinatorial problems in group theory." Thesis, University of Oxford, 2016. https://ora.ox.ac.uk/objects/uuid:b92af6aa-df2a-4634-882d-236d8f828857.

Full text

Abstract:

We study a number of problems of a group-theoretic origin or nature, but from a strongly additive-combinatorial or analytic perspective. Specifically, we consider the following particular problems. 1. Given an arbitrary set of n positive integers, how large a subset can you be sure to find which is sum-free, i.e., which contains no two elements x and y as well as their sum x+y? More generally, given a linear homogeneous equation E, how large a subset can you be sure to find which contains no solutions to E? 2. Given a finite group G, suppose we measure the degree of abelianness of G by its com

APA, Harvard, Vancouver, ISO, and other styles

7

Walker, Aled. "Topics in analytic and combinatorial number theory." Thesis, University of Oxford, 2018. http://ora.ox.ac.uk/objects/uuid:0d48a697-fd7a-4aca-bebe-4806322bdbbd.

Full text

Abstract:

In this thesis we consider three different issues of analytic number theory. Firstly, we investigate how residues modulo q may be expressed as products of small primes. In Chapter 1, we work in the regime in which these primes are less than q, and present some partial results towards an open conjecture of Erdös. In Chapter 2, we consider the kinder regime in which these primes are at most q<sup>C</sup> , for some constant C that is greater than 1. Here we reach an explicit version of Linnik's Theorem on the least prime in an arithmetic progression, saving that we replace 'prime' with 'product

APA, Harvard, Vancouver, ISO, and other styles

8

Rechner, Steffen [Verfasser]. "Markov Chain Monte Carlo algorithms for the uniform sampling of combinatorial objects / Steffen Rechner." Halle, 2018. http://d-nb.info/1161729674/34.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Demetriades, Marina. "Dynamic combinatorial mass spectrometry for 2-oxoglutarate oxygenase inhibition." Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:8c3a3a33-bc1a-407e-8b86-70c5eca58f38.

Full text

Abstract:

In the last decade, dynamic combinatorial mass spectrometry (DCMS) with protein targets has emerged as a promising method for the identification of enzyme-inhibitors. 2-Oxoglutarate (2OG) oxygenases are involved in important biological processes related to many diseases; several human 2OG oxygenases are targeted for pharmaceutical intervention. This thesis describes inhibition studies on three 2OG oxygenases using DCMS and structure activity relation (SAR) studies. Disulphide based DCMS was used for the identification of N-oxalyl based lead inhibitors for the 2OG oxygenase AlkB from Escherichi

APA, Harvard, Vancouver, ISO, and other styles

10

Konieczny, Jakub. "On combinatorial properties of nil-Bohr sets of integers and related problems." Thesis, University of Oxford, 2017. https://ora.ox.ac.uk/objects/uuid:5afe1811-b37b-49a4-aecf-882f8ca0fb87.

Full text

Abstract:

This thesis deals with six problems in additive combinatorics and ergodic theory. A brief introduction to this general area and a summary of included results is given in Chapter I. In Chapter II, we consider sets of the form { n &straightepsilon; &Nopf;<suB>0</sub> | |p(n) mod 1| ≤ ϵ (n) }, where p is a polynomial and ϵ(n) ≥ 0. We obtain various conditions under which any sufficiently large integer can be represented as a sum of 2 or 3 elements of a given set of this form. In Chapter III, we study the class of weakly mixing sets of integers, and prove that a certain class of

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Combinatorial objects"

1

Faradžev, I. A., A. A. Ivanov, M. H. Klin, and A. J. Woldar, eds. Investigations in Algebraic Theory of Combinatorial Objects. Springer Netherlands, 1994. http://dx.doi.org/10.1007/978-94-017-1972-8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Grossman, Robert. Hopf-algebraic structure of combinatorial objects and different operators. National Aeronautics and Space Administration, 1989.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Combinatorial foundation of homology and homotopy: Applications to spaces, diagrams, transformation groups, compactifications, differential algebras, algebraic theories, simplicial objects, and resolutions. Springer, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

Baues, Hans J. Combinatorial foundation of homology and homotopy: Applications to spaces, diagrams, transformation groups, compactifications, differential algebras, algebraic theories, simplicial objects, and resolutions. Springer, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Streit, Roy, Robert Blair Angle, and Murat Efe. Analytic Combinatorics for Multiple Object Tracking. Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-61191-0.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Chigbu, Polycarp E. Semi-latin squares and related "objects": Statistics and combinatorics aspects : an inaugural lecture of the University of Nigeria, delivered on January 26, 2009. University of Nigeria, Senate Ceremonials Committee, 2009.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Nakov, Svetlin. Fundamentals of Computer Programming with C#: The Bulgarian C# Book. Svetlin Nakov, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

A, Faradzhev I., ed. Investigtions in algebraic theory of combinatorial objects. Boston, 1994.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Ivanov, A. A., I. A. Faradzev, and M. Klin. Investigations in Algebraic Theory of Combinatorial Objects. Springer, 2014.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Faradzev, I. A. Investigations in Algebraic Theory of Combinatorial Objects. Springer, 2010.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Combinatorial objects"

1

Dougherty, Steven T. "Combinatorial Objects." In Springer Undergraduate Mathematics Series. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-56395-0_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Devroye, Luc. "Random Combinatorial Objects." In Non-Uniform Random Variate Generation. Springer New York, 1986. http://dx.doi.org/10.1007/978-1-4613-8643-8_13.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Sane, Sharad S. "Listing combinatorial objects." In Texts and Readings in Mathematics. Hindustan Book Agency, 2013. http://dx.doi.org/10.1007/978-93-86279-55-2_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Shen, Alexander. "Generation of combinatorial objects." In Algorithms and Programming. Birkhäuser Boston, 1997. http://dx.doi.org/10.1007/978-0-8176-4761-2_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Stanton, Dennis, and Dennis White. "Listing Basic Combinatorial Objects." In Constructive Combinatorics. Springer New York, 1986. http://dx.doi.org/10.1007/978-1-4612-4968-9_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Shen, Alexander. "Generation of combinatorial objects." In Springer Undergraduate Texts in Mathematics and Technology. Springer New York, 2009. http://dx.doi.org/10.1007/978-1-4419-1748-5_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Weng, Jia F. "Minimum Networks for Separating and Surrounding Objects." In Combinatorial Optimization. Springer US, 2001. http://dx.doi.org/10.1007/978-1-4613-0255-1_14.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Böhm, Stanislav, Jakub Beránek, and Martin Šurkovský. "Haydi: Rapid Prototyping and Combinatorial Objects." In Lecture Notes in Computer Science. Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-90050-6_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Klin, Mikhail, Sven Reichard, and Andrew Woldar. "Siamese Combinatorial Objects via Computer Algebra Experimentation." In Algorithmic Algebraic Combinatorics and Gröbner Bases. Springer Berlin Heidelberg, 2009. http://dx.doi.org/10.1007/978-3-642-01960-9_2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Sagot, Marie-France, and Alain Viari. "Flexible identification of structural objects in nucleic acid sequences: Palindromes, mirror repeats, pseudoknots and triple helices." In Combinatorial Pattern Matching. Springer Berlin Heidelberg, 1997. http://dx.doi.org/10.1007/3-540-63220-4_62.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Combinatorial objects"

1

Steinruecken, Christian. "Compressing Combinatorial Objects." In 2016 Data Compression Conference (DCC). IEEE, 2016. http://dx.doi.org/10.1109/dcc.2016.77.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Doslic, Tomislav. "Secondary structures and some related combinatorial objects." In 1st Croatian Combinatorial Days. University of Zagreb Faculty of Civil Engineering, 2017. http://dx.doi.org/10.5592/co/ccd.2016.02.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Martinjak, Ivica, and Ivana Zubac. "Secondary structures and some related combinatorial objects." In 1st Croatian Combinatorial Days. University of Zagreb Faculty of Civil Engineering, 2017. http://dx.doi.org/10.5592/co/ccd.2016.04.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Yu, Chan, and Souran Manoochehri. "Optimal Layout of Irregularly Shaped Objects." In ASME 2000 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference. American Society of Mechanical Engineers, 2000. http://dx.doi.org/10.1115/detc2000/dac-14227.

Full text

Abstract:

Abstract A new method is being developed to automatically generate an optimal solution of the two-dimensional layout problem. Finding the optimal solution of a layout design problem, especially that of irregular shapes, is quite difficult and requires an extensive amount of computation mainly due to the combinatorial nature of the problem. In this work, each object is categorized into either a mating or a non-mating group based on its concavity features. Each mating object is then decomposed into sets of convex objects and its mating conditions are then checked with other mating objects. Based

APA, Harvard, Vancouver, ISO, and other styles

5

Trefftz, Christian, and Jerry Scripps. "Revisiting a Pattern for Processing Combinatorial Objects in Parallel." In 2013 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW). IEEE, 2013. http://dx.doi.org/10.1109/ipdpsw.2013.123.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Suzuki, Takanobu, Atsuhiro Takasu, and Jun Adachi. "Top-kquery processing for combinatorial objects using Euclidean distance." In the 15th Symposium. ACM Press, 2011. http://dx.doi.org/10.1145/2076623.2076651.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dragone, Paolo. "Constructive Recommendation." In Twenty-Sixth International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence Organization, 2017. http://dx.doi.org/10.24963/ijcai.2017/748.

Full text

Abstract:

Constructive recommendation is the task of recommending object “configurations”, i.e. objects that can be assembled from their components on the basis of the user preferences. Examples include: PC configurations, recipes, travel plans, layouts, and other structured objects. Recommended objects are created by maximizing a learned utility function over an exponentially (or even infinitely) large combinatorial space of configurations. The utility function is learned through preference elicitation, an interactive process for collecting user feedback about recommended objects. Constructive recommen

APA, Harvard, Vancouver, ISO, and other styles

8

Diegert, Carl. "A combinatorial method for tracing objects using semantics of their shape." In 2010 IEEE Applied Imagery Pattern Recognition Workshop (AIPR 2010). IEEE, 2010. http://dx.doi.org/10.1109/aipr.2010.5759716.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Schweitzer, Pascal, and Daniel Wiebking. "A unifying method for the design of algorithms canonizing combinatorial objects." In STOC '19: 51st Annual ACM SIGACT Symposium on the Theory of Computing. ACM, 2019. http://dx.doi.org/10.1145/3313276.3316338.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Krpec, Radek. "WHAT EFFECT HAS THE ABILITY OF THE ORGANIZATION OBJECTS TO SOLVE COMBINATORIAL TASKS." In International Technology, Education and Development Conference. IATED, 2016. http://dx.doi.org/10.21125/iceri.2016.1851.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Reports on the topic "Combinatorial objects"

1

Montanez, Carmelo, D. Richard Kuhn, Mary Brady, Richard M. Rivello, Jenise Reyes, and Michael K. Powers. An application of combinatorial methods to conformance testing for document object model events. National Institute of Standards and Technology, 2010. http://dx.doi.org/10.6028/nist.ir.7773.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Grimson, W. E. The Combinatorics of Object Recognition in Cluttered Environments Using Constrained Search. Defense Technical Information Center, 1988. http://dx.doi.org/10.21236/ada196224.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Grimson, W. E. The Combinatorics of Heuristic Search Termination for Object Recognition in Cluttered Environments. Defense Technical Information Center, 1989. http://dx.doi.org/10.21236/ada209690.

Full text

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!