Log in

Relevant bibliographies by topics / Combinatorics ; Mathematical Sciences

Contents

Journal articles
Dissertations / Theses
Books
Book chapters
Conference papers

Academic literature on the topic 'Combinatorics ; Mathematical Sciences'

Author: Grafiati

Published: 4 June 2021

Last updated: 13 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 'Combinatorics ; Mathematical Sciences.'

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 ; Mathematical Sciences"

1

OVCHINNIKOV, SERGEI, and ALEXANDER DUKHOVNY. "ADVANCES IN MEDIA THEORY." International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 08, no. 01 (2000): 45–71. http://dx.doi.org/10.1142/s0218488500000058.

Full text

Abstract:

Media theory is a new branch of mathematical social and behavioral sciences with applications ranging from combinatorics to political sciences. Because of the generality of the concept of a medium and the natural character of its defining axioms, we believe the theory has a potential to become a new methodology for the management of imprecise, uncertain or incomplete information. In this paper, we review the basic concepts of media theory and present some advances in its combinatorial and stochastic parts. We prove that any medium is isomorphic to a submedium of a complete oriented medium and

APA, Harvard, Vancouver, ISO, and other styles

2

Editorial Board, ADM. "Fedir Mykolayovych Lyman (22.02.1941–13.06.2020)." Algebra and Discrete Mathematics 30, no. 1 (2020): C—E. http://dx.doi.org/10.12958/adm1749.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Arsic, Branko, Dragos Cvetkovic, Slobodan Simic, and Milan Skaric. "Graph spectral techniques in computer sciences." Applicable Analysis and Discrete Mathematics 6, no. 1 (2012): 1–30. http://dx.doi.org/10.2298/aadm111223025a.

Full text

Abstract:

We give a survey of graph spectral techniques used in computer sciences. The survey consists of a description of particular topics from the theory of graph spectra independently of the areas of Computer science in which they are used. We have described the applications of some important graph eigenvalues (spectral radius, algebraic connectivity, the least eigenvalue etc.), eigenvectors (principal eigenvector, Fiedler eigenvector and other), spectral reconstruction problems, spectra of random graphs, Hoffman polynomial, integral graphs etc. However, for each described spectral technique we indi

APA, Harvard, Vancouver, ISO, and other styles

4

KHODAKOVSKA, Olena, and Svitlana USTYCHENKO. "THE DEVELOPMENT OF MATHEMATICAL CULTURE OF STUDENTS AS A COMPONENT OF PROFESSIONAL COMPETENCE." Cherkasy University Bulletin: Pedagogical Sciences, no. 2 (2020): 131–36. http://dx.doi.org/10.31651/2524-2660-2020-2-131-136.

Full text

Abstract:

Introduction. In recent years, teachers of most technical and natural sciences faculties find the level of freshmen starting a course of higher mathematics insuf-ficient to comprehend the basics of logical constructions. It is difficult for students to clearly realize that, for example, they should learn to prove a statement as a theorem or give a counter-example; in mathematics there are such terms as necessary and sufficient conditions, cause and effect; the system of equations and their totality are dif-ferent things; the properties of mathematical objects are subject of study; solving ineq

APA, Harvard, Vancouver, ISO, and other styles

5

Hwang, Hsien-Kuei, Ralph Neininger, and Marek Zaionc. "Preface." Combinatorics, Probability and Computing 28, no. 4 (2019): 483–84. http://dx.doi.org/10.1017/s0963548319000166.

Full text

Abstract:

This special issue is devoted to the Mathematical Analysis of Algorithms, which aims to predict the performance of fundamental algorithms and data structures in general use in Computer Science. The simplest measure of performance is the expected value of a cost function under natural models of randomness for the data, and finer properties of the cost distribution provide a deeper understanding of the complexity. Research in this area, which is intimately connected to combinatorics and random discrete structures, uses a rich variety of combinatorial, analytic and probabilistic methods.

APA, Harvard, Vancouver, ISO, and other styles

6

Semanišinová, Ingrid. "Multiple-Solution Tasks in Pre-Service Teachers Course on Combinatorics." Mathematics 9, no. 18 (2021): 2286. http://dx.doi.org/10.3390/math9182286.

Full text

Abstract:

In the paper, we present a study devoted to the utilization of multiple-solution tasks (MSTs) in combinatorics as a part of a pre-service teachers course on didactics of mathematics from the view of the mathematics teachers’ specialized knowledge (MTSK) theoretical framework. The study was carried out over the standard course of a summer semester in 2021. The course was attended by 13 pre-service teachers (PSTs). It was carried out online, due to COVID-19 restrictions. Ten combinatorial multiple-solution tasks were assigned to the PSTs. Analyzing pre-service teachers solutions to these tasks,

APA, Harvard, Vancouver, ISO, and other styles

7

Kirzhner, Valery, Dvora Toledano-Kitai, and Zeev Volkovich. "Evaluating the number of different genomes in a metagenome by means of the compositional spectra approach." PLOS ONE 15, no. 11 (2020): e0237205. http://dx.doi.org/10.1371/journal.pone.0237205.

Full text

Abstract:

Determination of metagenome composition is still one of the most interesting problems of bioinformatics. It involves a wide range of mathematical methods, from probabilistic models of combinatorics to cluster analysis and pattern recognition techniques. The successful advance of rapid sequencing methods and fast and precise metagenome analysis will increase the diagnostic value of healthy or pathological human metagenomes. The article presents the theoretical foundations of the algorithm for calculating the number of different genomes in the medium under study. The approach is based on analysi

APA, Harvard, Vancouver, ISO, and other styles

8

GAVISH, BEZALEL. "COMBINATORIAL AUCTIONS MATHEMATICAL FORMULATIONS AND OPEN ISSUES." International Journal of Information Technology & Decision Making 02, no. 01 (2003): 5–27. http://dx.doi.org/10.1142/s0219622003000495.

Full text

Abstract:

The widespread use of the Internet fostered the establishment of hundreds of sites that support on-line auctions of products and services, some of which also support combinatorial auctions. Finding the optimal combination of winning bids in combinatorial auctions is a difficult task. This paper presents the combinatorial auction problem, classifies combinatorial auctions by the different procedures used during the bidding process, presents some of the applications of combinatorial auctions, and develops mathematical models of combinatorial auctions. The mathematical models are used to identify

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

Yang, Chuan Sheng, Hong Bo Wang, and You Fu Jiang. "Some Properties of (Inverse)N₀-Matrices with its Applications." Applied Mechanics and Materials 590 (June 2014): 795–98. http://dx.doi.org/10.4028/www.scientific.net/amm.590.795.

Full text

Abstract:

In this paper we study some combinatorial properties and inequalities of some classes of Z-matrices. These matrices arise in many problems in the mathematical and physical sciences. We show that all (inverse)N0-matrices are irreducible and some eigenvalue inequalities of (inverse)N0-matrices.

APA, Harvard, Vancouver, ISO, and other styles

Dissertations / Theses on the topic "Combinatorics ; Mathematical Sciences"

1

Day, Alan Nicholas. "A collection of problems in extremal combinatorics." Thesis, Queen Mary, University of London, 2018. http://qmro.qmul.ac.uk/xmlui/handle/123456789/36669.

Full text

Abstract:

Extremal combinatorics is concerned with how large or small a combinatorial structure can be if we insist it satis es certain properties. In this thesis we investigate four different problems in extremal combinatorics, each with its own unique flavour. We begin by examining a graph saturation problem. We say a graph G is H-saturated if G contains no copy of H as a subgraph, but the addition of any new edge to G creates a copy of H. We look at how few edges a Kp- saturated graph can have when we place certain conditions on its minimum degree. We look at a problem in Ramsey Theory. The k-colour

APA, Harvard, Vancouver, ISO, and other styles

2

Pinto, Trevor Alvaro Anthony. "Extremal problems on the hypercube." Thesis, Queen Mary, University of London, 2016. http://qmro.qmul.ac.uk/xmlui/handle/123456789/23651.

Full text

Abstract:

The hypercube, Qd, is a natural and much studied combinatorial object, and we discuss various extremal problems related to it. A subgraph of the hypercube is said to be (Qd; F)-saturated if it contains no copies of F, but adding any edge forms a copy of F. We write sat(Qd; F) for the saturation number, that is, the least number of edges a (Qd; F)-saturated graph may have. We prove the upper bound sat(Qd;Q2) < 10 2d, which strongly disproves a conjecture of Santolupo that sat(Qd;Q2) = 1 4 + o(1) d2d 1. We also prove upper bounds on sat(Qd;Qm) for general m. Given a down-set A and an up-set B in

APA, Harvard, Vancouver, ISO, and other styles

3

Hagen, Mark. "Geometry and combinatorics of cube complexes." Thesis, McGill University, 2012. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=107799.

Full text

Abstract:

We study the geometry of median graphs and CAT(0) cube complexes by introducing two combinatorial objects: the contact graph and the simplicial boundary. The first of these encodes the intersections of hyperplane-carriers. We prove that this graph is always quasi-isometric to a tree, and deduce that groups acting properly and cocompactly on cube complexes are weakly hyperbolic relative to the collection of hyperplane-stabilizers. Using diagrammatic techniques of Casson-Sageev-Wise, we study complete bipartite subgraphs of the contact graph, and prove a cubical version of the flat plane theo

APA, Harvard, Vancouver, ISO, and other styles

4

Chen, Bo. "Combinatorial Proofs Using Complex Weights." Scholarship @ Claremont, 2010. https://scholarship.claremont.edu/hmc_theses/16.

Full text

Abstract:

In 1961, Kasteleyn, Fisher, and Temperley gave a result for the number of possible tilings of a 2m 2n checkerboard with dominoes. Their proof involves the evaluation of a complicated Pfaffian. In this thesis we investigate combinatorial strategies to evaluate the sum of evenly spaced binomial coefficients, and present steps towards a purely combinatorial proof of the 1961 result.

APA, Harvard, Vancouver, ISO, and other styles

5

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

6

Violin, Alessia. "Mathematical programming approaches to pricing problems." Doctoral thesis, Universite Libre de Bruxelles, 2014. http://hdl.handle.net/2013/ULB-DIPOT:oai:dipot.ulb.ac.be:2013/209173.

Full text

Abstract:

There are many real cases where a company needs to determine the price of its products so as to maximise its revenue or profit.<p>To do so, the company must consider customers' reactions to these prices, as they may refuse to buy a given product or service if its price is too high. This is commonly known in literature as a pricing problem.<p>This class of problems, which is typically bilevel, was first studied in the 1990s and is NP-hard, although polynomial algorithms do exist for some particular cases. Many questions are still open on this subject.<p><p>The aim of this thesis is to investiga

APA, Harvard, Vancouver, ISO, and other styles

7

McFaddin, Rita Jane. "Combinatorics for the Third Grade Classroom." Digital Commons @ East Tennessee State University, 2006. https://dc.etsu.edu/etd/2227.

Full text

Abstract:

After becoming interested in the beauty of numbers and the intricate patterns of their behavior, the author concluded that it would be a good idea to make the subject available for students earlier in their educational experience. In this thesis, the author developed four units in combinatorics, namely Fundamental Principles, Permutations, Combinations, and Pascal's Triangle, which are appropriate for third grade level.

APA, Harvard, Vancouver, ISO, and other styles

8

Yang, Yingying. "An Application of Combinatorial Methods." VCU Scholars Compass, 2005. http://scholarscompass.vcu.edu/etd/662.

Full text

Abstract:

Probability theory is a branch of mathematics concerned with determining the long run frequency or chance that a given event will occur. This chance is determined by dividing the number of selected events by the number of total events possible, assuming these events are equally likely. Probability theory is simply enumerative combinatorial analysis when applied to finite sets. For a given finite sample space, probability questions are usually "just" a lot of counting. The purpose of this thesis is to provide some in depth analysis of several combinatorial methods, including basic principles

APA, Harvard, Vancouver, ISO, and other styles

9

Mustafa, Nabil. "Approximations of Points: Combinatorics and Algorithms." Habilitation à diriger des recherches, Université Paris-Est, 2013. http://tel.archives-ouvertes.fr/tel-01062825.

Full text

Abstract:

At the core of successful manipulation and computation over large geometric data is the notion of approximation, both structural and computational. The focus of this thesis will be on the combinatorial and algorithmic aspects of approximations of point-set data P in d-dimensional Euclidean space. It starts with a study of geometric data depth where the goal is to compute a point which is the 'combinatorial center' of P. Over the past 50 years several such measures of combinatorial centers have been proposed, and we will re-examine several of them: Tukey depth, Simplicial depth, Oja depth and R

APA, Harvard, Vancouver, ISO, and other styles

10

Manchester, Schuyler. "Combinatorial-Based Prioritization For User-Session-Based Test Suites." DigitalCommons@USU, 2012. https://digitalcommons.usu.edu/etd/1202.

Full text

Abstract:

Software defects caused by inadequate software testing can cost billions of dollars. Further, web application defects can be costly due to the fact that most web applications handle constant user interaction. However, software testing is often under time and budget constraints. By improving the time efficiency of software testing, many of the costs associated with defects can be saved. Current methods for web application testing can take too long to generate test suites. In addition, studies have shown that user-session-based test suites often find faults missed by other testing techniques. Th

APA, Harvard, Vancouver, ISO, and other styles

Books on the topic "Combinatorics ; Mathematical Sciences"

1

Quantitative graph theory: Mathematical foundations and applications. CRC Press, Taylor & Francis Group, 2015.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

2

Model theoretic methods in finite combinatorics: AMS-ASL special session, January 5-8, 2009 Washington, DC. American Mathematical Society, 2011.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

3

Pardalos, P. M. Handbook of combinatorial optimization. Springer, 2013.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

4

1945-, Shrikhande Mohan S., ed. Combinatorics of symmetric designs. Cambridge University Press, 2006.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

5

Jukna, Stasys. Extremal Combinatorics: With Applications in Computer Science. Springer Berlin Heidelberg, 2001.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

6

Applied combinatorics. 2nd ed. Prentice-Hall, 2005.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

7

Introductory combinatorics. 3rd ed. Prentice Hall, 1999.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

8

Brualdi, Richard A. Introductory combinatorics. 2nd ed. Prentice Hall, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

9

Introductory combinatorics. 4th ed. Pearson/Prentice Hall, 2004.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

10

Introductory combinatorics. 2nd ed. North-Holland, 1992.

Find full text

APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Combinatorics ; Mathematical Sciences"

1

Aldous, David. "Simple Combinatorics." In Applied Mathematical Sciences. Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4757-6283-9_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Aldous, David. "Combinatorics for Processes." In Applied Mathematical Sciences. Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4757-6283-9_6.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Gavrilov, G. P., and A. A. Sapozhenko. "Combinatorics." In Kluwer Texts in the Mathematical Sciences. Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-017-2770-9_8.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Gavrilov, G. P., and A. A. Sapozhenko. "Combinatorics." In Kluwer Texts in the Mathematical Sciences. Springer Netherlands, 1996. http://dx.doi.org/10.1007/978-94-017-2770-9_18.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Vince, John. "Combinatorics." In Foundation Mathematics for Computer Science. Springer International Publishing, 2020. http://dx.doi.org/10.1007/978-3-030-42078-9_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Aldous, David. "Exponential Combinatorial Extrema." In Applied Mathematical Sciences. Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4757-6283-9_7.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Harary, Frank. "Early Computer Science Adventures of a Mathematician." In Combinatorics, Computability and Logic. Springer London, 2001. http://dx.doi.org/10.1007/978-1-4471-0717-0_1.

Full text

APA, Harvard, Vancouver, ISO, and other styles

8

Hayashi, Takao. "Combinatorics in Indian Mathematics." In Encyclopaedia of the History of Science, Technology, and Medicine in Non-Western Cultures. Springer Netherlands, 2016. http://dx.doi.org/10.1007/978-94-007-7747-7_9223.

Full text

APA, Harvard, Vancouver, ISO, and other styles

9

Hayashi, Takao. "Combinatorics in Indian Mathematics." In Encyclopaedia of the History of Science, Technology, and Medicine in Non-Western Cultures. Springer Netherlands, 2014. http://dx.doi.org/10.1007/978-94-007-3934-5_9223-2.

Full text

APA, Harvard, Vancouver, ISO, and other styles

10

Trevisan, Luca. "Pseudorandomness In Computer Science and In Additive Combinatorics." In Bolyai Society Mathematical Studies. Springer Berlin Heidelberg, 2010. http://dx.doi.org/10.1007/978-3-642-14444-8_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Combinatorics ; Mathematical Sciences"

1

KIM, K. H., and F. W. ROUSH. "COMBINATORIAL ASPECTS OF MATHEMATICAL SOCIAL SCIENCE." In Present and Future. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812799890_0003.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Gonnet, Gaston. "Mathematics and Computer Science serving/impacting Bioinformatics." In 2009 Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO). Society for Industrial and Applied Mathematics, 2009. http://dx.doi.org/10.1137/1.9781611972993.5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Murodillayevich, Nuraliyev Faxriddin, Anarova Shahzoda Amanbayevna, and Norzullayev Oybek Mirzayevich. "Mathematical and software of fractal structures from combinatorial numbers." In 2019 International Conference on Information Science and Communications Technologies (ICISCT). IEEE, 2019. http://dx.doi.org/10.1109/icisct47635.2019.9012051.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Jamri, A. A. S. Ahmad, Sh K. Said Husain, and I. S. Rakhimov. "Combinatorial structures associated with low dimensional second class of non-Lie filiform Leibniz algebra." In PROCEEDINGS OF THE 24TH NATIONAL SYMPOSIUM ON MATHEMATICAL SCIENCES: Mathematical Sciences Exploration for the Universal Preservation. Author(s), 2017. http://dx.doi.org/10.1063/1.4995834.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Molinero, Xavier. "Combinatorial structures to modeling simple games and applications." In MATHEMATICAL METHODS AND COMPUTATIONAL TECHNIQUES IN SCIENCE AND ENGINEERING. Author(s), 2017. http://dx.doi.org/10.1063/1.4996680.

Full text

APA, Harvard, Vancouver, ISO, and other styles

6

Fesenko, Herman, Vyacheslav Kharchenko, and Nikos Bardis. "An approach to the drone fleet survivability assessment based on a combinatorial model." In MATHEMATICAL METHODS AND COMPUTATIONAL TECHNIQUES IN SCIENCE AND ENGINEERING II. Author(s), 2018. http://dx.doi.org/10.1063/1.5045453.

Full text

APA, Harvard, Vancouver, ISO, and other styles

7

Dupas, Remy, Igor Grebennik, and Oleksandr Lytvynenko. "Combinatorial mathematical model and decision strategy for one-to-one pickup and delivery problem with 3D loading constraints." In 2015 Xth International Scientific and Technical Conference "Computer Sciences and Information Technologies" (CSIT). IEEE, 2015. http://dx.doi.org/10.1109/stc-csit.2015.7325450.

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!