Zaloguj się

Gotowe bibliografie tematyczne / Combinatorics

Spis treści

Artykuły w czasopismach
Rozprawy doktorskie
Książki
Części książek
Streszczenia konferencji
Raporty organizacyjne

Gotowa bibliografia na temat „Combinatorics”

Autor: Grafiati

Data publikacji: 4 czerwca 2021

Data aktualizacji: 12 października 2024

Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych

Wybierz rodzaj źródła:

Zobacz listy aktualnych artykułów, książek, rozpraw, streszczeń i innych źródeł naukowych na temat „Combinatorics”.

Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.

Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.

Artykuły w czasopismach na temat "Combinatorics"

1

Mazza, Giordano. "The Secrets of Calvino's Ars Combinatoria". Italica 99, nr 1 (1.03.2022): 40–57. http://dx.doi.org/10.5406/23256672.99.1.04.

Pełny tekst źródła

Streszczenie:

Abstract In this article, I explore the relationship between secrets and ars combinatoria, or the art of combining elements.1 In particular, I analyze this relationship in Italo Calvino's works, as Calvino can be thought of as the major representative of combinatorial literature in Italy. Although there are several published articles discussing the literary theory on secrecy, and several more analyzing combinatorial literature in Calvino, none discusses the importance of secrets in Calvino or links combinatorial literature with secrecy. I argue that ars combinatoria and, more specifically, combinatorial literature, is always closely linked with secrecy. I demonstrate that secrecy is a key aspect of combinatorial literature and that such combinatory elements become an essential part of Calvino's storytelling. I first define each of these terms (secrecy and combinatorics) in a broader context and then in the context of their literary usage.

Style APA, Harvard, Vancouver, ISO itp.

2

Gerards, A. M. H., i A. W. J. Kolen. "Polyhedral Combinatorics in Combinatorial Optimization". Statistica Neerlandica 41, nr 1 (marzec 1987): 1–25. http://dx.doi.org/10.1111/j.1467-9574.1987.tb01168.x.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

MANDARIA, George. "The Methodology of Teaching Algorithms of Combinatorics: Permutations, Combinations, Arrangements". Journal of Technical Science and Technologies 7, nr 2 (15.12.2018): 1–6. http://dx.doi.org/10.31578/jtst.v7i2.139.

Pełny tekst źródła

Streszczenie:

In this article we have described the methodology for teaching the algorithms of combinatorics which are often used when solving tasks of informatics. These are the economic types of tasks in which we need to select different objects, sort selected objects in some order and choose the best selection from all possible selections. The formulas of calculating number of such selections are known from mathematics, but in informatics we are interested not only in number, but also in selections themselves, which can be generated by special algorithms. In general, the number of such selections is quite large, so we need to use optimal algorithms to find the desired answer in real time. The essence of combinatoric objects is explained. It is shown how to find the desired object in optimal way. The samples and description of the corresponding algorithms are presented using the programming language C ++. Keywords: Combinatorics, Methodology, Permutations, Combinations, Arrangements, Combinatorial object, Selections

Style APA, Harvard, Vancouver, ISO itp.

4

Rocha, Cristiane Arimatéa, i Antonio Carlos De Souza. "Conhecimento de crianças pequenas da Educação Infantil e alunos dos anos iniciais do Ensino Fundamental sobre Combinatória: O que apontam as pesquisas brasileiras no período de 2010 a 2019?<br>Conocimiento de los niños pequeños en Educación Infantil y de los estudiantes de los primeros años de la escuela primaria sobre Combinatoria: ¿Qué señalan las investigaciones brasileñas en el período 2010-2019?" Educação Matemática Pesquisa Revista do Programa de Estudos Pós-Graduados em Educação Matemática 23, nr 4 (4.07.2021): 452–84. http://dx.doi.org/10.23925/983-3156.2021v23i4p452-484.

Pełny tekst źródła

Streszczenie:

A presente investigação discorre sobre um recorte de um projeto que visa apresentar as pesquisas em Educação Estatística no Brasil publicadas em periódicos da área de Ensino entre os anos de 2010 a 2019. Definimos como objetivo, para esse recorte, discutir pesquisas brasileiras que abordam conhecimentos de crianças pequenas da Educação Infantil e alunos dos anos iniciais do Ensino Fundamental sobre Combinatória no período mencionado. Foram identificados oito trabalhos que tratam direta ou indiretamente sobre conhecimentos de combinatória dos estudantes dessas etapas de escolarização. Direcionamos nosso olhar para os problemas combinatórios utilizados nas pesquisas, ressaltando aspectos como os diferentes tipos de problemas, a ordem de grandeza adotada (número total de possibilidades), os contextos evidenciados pelos problemas, além dos recursos utilizados para apresentação das atividades aos participantes da pesquisa. Verificamos que as pesquisas brasileiras estão em consonância com as investigações dos diferentes países e apresentam um avanço no sentido de permitir a discussão, nessas etapas de escolarização, dos diferentes tipos de problemas combinatórios em um mesmo estudo. Consideramos a necessidade de que outras pesquisas sejam realizadas abordando a elaboração de argumentos pessoais na resolução de problemas combinatórios. The present investigation discusses an excerpt from a project that aims to discuss the research on Statistical Education in Brazil published in journals in the area of Mathematics Education between the years 2010 to 2019. We set the objective to discuss Brazilian research that addresses the knowledge of young children in kindergarten and students in the early years of elementary school about Combinatorics in this period. Eight papers were identified that deal directly or indirectly with combinatorics knowledge of students' in these schooling stages. We focused on the combinatorial problems used in the research, highlighting aspects such as the different types of problems, the order of magnitude adopted (total number of possibilities), the contexts evidenced by the problems, in addition to the resources used to present the activities to the research participants. We verified that Brazilian research is in line with the investigations from different countries and presents an advance in the sense of allowing the discussion of different types of combinatorial problems in the same study. We consider that further research should be conducted addressing the development of personal arguments in solving combinatorial problems. La presente investigación discute un extracto de un proyecto que tiene como objetivo presentar las investigaciones en Educación Estadística en Brasil, publicadas en revistas del área de Matemáticas Educativas entre los años 2010 y 2019. Nos fijamos como objetivo, para este extracto, discutir la investigación brasileña que aborda el conocimiento de los niños pequeños en Educación Infantil y de los estudiantes en los primeros años de la escuela primaria en Combinatoria en ese período de tiempo. Se identificaron ocho estudios que tratan directa o indirectamente el conocimiento combinatorio de los estudiantes de estas etapas de la escolarización. Centramos nuestra atención en los problemas combinatorios utilizados en las investigaciones, destacando aspectos como los diferentes tipos de problemas, el orden de magnitud adoptado (número total de posibilidades), los contextos evidenciados por los problemas, además de los recursos utilizados para presentar las actividades a los participantes de la investigación. Encontramos que la investigación brasileña está en línea con las investigaciones de diferentes países y presenta un avance en el sentido de permitir la discusión de diferentes tipos de problemas combinatorios en un mismo estudio. Consideramos la necesidad de que se realicen otras investigaciones que aborden la elaboración de argumentos personales en la solución de problemas combinatorios.

Style APA, Harvard, Vancouver, ISO itp.

5

Mardiningsih, Saib Suwilo i Ihda Hasbiyati. "Existence of Polynomial Combinatorics Graph Solution". Journal of Research in Mathematics Trends and Technology 2, nr 1 (24.02.2020): 7–13. http://dx.doi.org/10.32734/jormtt.v2i1.3755.

Pełny tekst źródła

Streszczenie:

The Polynomial Combinatorics comes from optimization problem combinatorial in form the nonlinear and integer programming. This paper present a condition such that the polynomial combinatorics has solution. Existence of optimum value will be found by restriction of decision variable and properties of feasible solution set or polyhedra.

Style APA, Harvard, Vancouver, ISO itp.

6

Tao, Terence. "Algebraic combinatorial geometry: the polynomial method in arithmetic combinatorics, incidence combinatorics, and number theory". EMS Surveys in Mathematical Sciences 1, nr 1 (2014): 1–46. http://dx.doi.org/10.4171/emss/1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

HINKLE, BENJAMIN. "Parabolic limits of renormalization". Ergodic Theory and Dynamical Systems 20, nr 1 (luty 2000): 173–229. http://dx.doi.org/10.1017/s0143385700000092.

Pełny tekst źródła

Streszczenie:

A unimodal map $f:[0,1] \to [0,1]$ is renormalizable if there is a sub-interval $I \subset [0,1]$ and an $n > 1$ such that $f^n|_I$ is unimodal. The renormalization of $f$ is $f^n|_I$ rescaled to the unit interval.We extend the well-known classification of limits of renormalization of unimodal maps with bounded combinatorics to a classification of the limits of renormalization of unimodal maps with essentially bounded combinatorics. Together with results of Lyubich on the limits of renormalization with essentially unbounded combinatorics, this completes the combinatorial description of limits of renormalization. The techniques are based on the towers of McMullen and on the local analysis around perturbed parabolic points. We define a parabolic tower to be a sequence of unimodal maps related by renormalization or parabolic renormalization. We state and prove the combinatorial rigidity of bi-infinite parabolic towers with complex bounds and essentially bounded combinatorics, which implies the main theorem.As an example we construct a natural unbounded analogue of the period-doubling fixed point of renormalization, called the essentially period-tripling fixed point.

Style APA, Harvard, Vancouver, ISO itp.

8

Lecouvey, Cédric, i Cristian Lenart. "Combinatorics of Generalized Exponents". International Mathematics Research Notices 2020, nr 16 (5.07.2018): 4942–92. http://dx.doi.org/10.1093/imrn/rny157.

Pełny tekst źródła

Streszczenie:

Abstract We give a purely combinatorial proof of the positivity of the stabilized forms of the generalized exponents associated to each classical root system. In finite type $A_{n-1}$, we rederive the description of the generalized exponents in terms of crystal graphs without using the combinatorics of semistandard tableaux or the charge statistic. In finite type $C_{n}$, we obtain a combinatorial description of the generalized exponents based on the so-called distinguished vertices in crystals of type $A_{2n-1}$, which we also connect to symplectic King tableaux. This gives a combinatorial proof of the positivity of Lusztig $t$-analogs associated to zero-weight spaces in the irreducible representations of symplectic Lie algebras. We also present three applications of our combinatorial formula and discuss some implications to relating two type $C$ branching rules. Our methods are expected to extend to the orthogonal types.

Style APA, Harvard, Vancouver, ISO itp.

9

Shelah, Saharon, i Lee J. Stanley. "The combinatorics of combinatorial coding by a real". Journal of Symbolic Logic 60, nr 1 (marzec 1995): 36–57. http://dx.doi.org/10.2307/2275508.

Pełny tekst źródła

Streszczenie:

AbstractWe lay the combinatorial foundations for [5] by setting up and proving the essential properties of the coding apparatus for singular cardinals. We also prove another result concerning the coding apparatus for inaccessible cardinals.

Style APA, Harvard, Vancouver, ISO itp.

10

Seaman, Bill. "Oulipo | vs | Recombinant Poetics". Leonardo 34, nr 5 (październik 2001): 423–30. http://dx.doi.org/10.1162/002409401753521548.

Pełny tekst źródła

Streszczenie:

This paper compares and contrasts approaches to combinatorics in OULIPO and Recombinant Poetics. OULIPO, also known as Ouvroir de Litérature Potentielle, is a literary and artistic association founded in the 1960s whose combinatoric methods and experimental concepts continue to be generative and relevant to this day. Recombinant Poetics is a term that I coined in 1995 in order to define a particular approach to emergent meaning that is used in generative virtual environments and other computer-based combinatoric media forms. Combinatoric works enable the exploration of sets of media elements in different orders and combinations. The meaning of such work is derived through dynamic interaction. Another group exploring combinatorics uses digital audio techniques. The abbreviation “VS” (“versus”) is often used in techno-audio remix culture to designate the remix of one group's music by another, often having only an oblique relation to the original.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Rozprawy doktorskie na temat "Combinatorics"

1

Milicevic, Luka. "Topics in metric geometry, combinatorial geometry, extremal combinatorics and additive combinatorics". Thesis, University of Cambridge, 2018. https://www.repository.cam.ac.uk/handle/1810/273375.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Lopes, Martins Taísa. "Theory of combinatorial limits and extremal combinatorics". Thesis, University of Warwick, 2018. http://wrap.warwick.ac.uk/113462/.

Pełny tekst źródła

Streszczenie:

In the past years, techniques from different areas of mathematics have been successfully applied in extremal combinatorics problems. Examples include applications of number theory, geometry and group theory in Ramsey theory and analytical methods to different problems in extremal combinatorics. By providing an analytic point of view of many discrete problems, the theory of combinatorial limits led to substantial results in many areas of mathematics and computer science, in particular in extremal combinatorics. In this thesis, we explore the connection between combinatorial limits and extremal combinatorics. In particular, we prove that extremal graph theory problemsmay have unique optimal solutions with arbitrarily complex structure, study a property closely related to Sidorenko's conjecture, one of the most important open problems in extremal combinatorics, and prove a 30-year old conjecture of Gyori and Tuza regarding decomposing the edges of a graph into triangles and edges.

Style APA, Harvard, Vancouver, ISO itp.

3

Yue, Guangyi. "Combinatorics of affine Springer fibers and combinatorial wall-crossing". Thesis, Massachusetts Institute of Technology, 2020. https://hdl.handle.net/1721.1/126939.

Pełny tekst źródła

Streszczenie:

Thesis: Ph. D., Massachusetts Institute of Technology, Department of Mathematics, May, 2020
Cataloged from the official PDF of thesis.
Includes bibliographical references (pages 149-152).
This thesis deals with several combinatorial problems in representation theory. The first part of the thesis studies the combinatorics of affine Springer fibers of type A. In particular, we give an explicit description of irreducible components of Fl[subscript tS] and calculate the relative positions between two components. We also study the lowest two-sided Kazhdan-Lusztig cell and establish a connection with the affine Springer fibers, which is compatible with the affine matrix ball construction algorithm. The results also prove a special case of Lusztig's conjecture. The work in this part include joint work with Pablo Boixeda. In the second part, we define the combinatorial wall-crossing transformation and the generalized column regularization on partitions and prove that a certain composition of these two transformations has the same effect on the one-row partition. This result gives a special situation where column regularization, can be used to understand the complicated Mullineux map, and also proves a special case of Bezrukavnikov's conjecture. Furthermore, we prove a condition under which the two maps are exactly the same, generalizing the work of Bessenrodt, Olsson and Xu. The combinatorial constructions is related to the Iwahori-Hecke algebra and the global crystal basis of the basic [ ... ]-module and we provide several conjectures regarding the q-decomposition numbers and generalizations of results due to Fayers. This part is a joint work with Panagiotis Dimakis and Allen Wang.
by Guangyi Yue.
Ph. D.
Ph.D. Massachusetts Institute of Technology, Department of Mathematics

Style APA, Harvard, Vancouver, ISO itp.

4

Lange, Carsten. "Combinatorial curvatures, group actions, and colourings: aspects of topological combinatorics". [S.l.] : [s.n.], 2005. http://deposit.ddb.de/cgi-bin/dokserv?idn=973473487.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Engström, Alexander. "Topological Combinatorics". Doctoral thesis, KTH, Matematik (Inst.), 2009. http://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-10383.

Pełny tekst źródła

Streszczenie:

This thesis on Topological Combinatorics contains 7 papers. All of them but paper Bare published before.In paper A we prove that!i dim ˜Hi(Ind(G);Q) ! |Ind(G[D])| for any graph G andits independence complex Ind(G), under the condition that G\D is a forest. We then use acorrespondence between the ground states with i+1 fermions of a supersymmetric latticemodel on G and ˜Hi(Ind(G);Q) to deal with some questions from theoretical physics.In paper B we generalize the topological Tverberg theorem. Call a graph on the samevertex set as a (d + 1)(q − 1)-simplex a (d, q)-Tverberg graph if for any map from thesimplex to Rd there are disjoint faces F1, F2, . . . , Fq whose images intersect and no twoadjacent vertices of the graph are in the same face. We prove that if d # 1, q # 2 is aprime power, and G is a graph on (d+1)(q −1)+1 vertices such that its maximal degreeD satisfy D(D + 1) < q, then G is a (d, q)–Tverberg graph. It was earlier known that thedisjoint unions of small complete graphs, paths, and cycles are Tverberg graphs.In paper C we study the connectivity of independence complexes. If G is a graphon n vertices with maximal degree d, then it is known that its independence complex is(cn/d + !)–connected with c = 1/2. We prove that if G is claw-free then c # 2/3.In paper D we study when complexes of directed trees are shellable and how one canglue together independence complexes for finding their homotopy type.In paper E we prove a conjecture by Björner arising in the study of simplicial polytopes.The face vector and the g–vector are related by a linear transformation. We prove thatthis matrix is totaly nonnegative. This is joint work with Michael Björklund.In paper F we introduce a generalization of Hom–complexes, called set partition complexes,and prove a connectivity theorem for them. This generalizes previous results ofBabson, Cukic, and Kozlov, and questions from Ramsey theory can be described with it.In paper G we use combinatorial topology to prove algebraic properties of edge ideals.The edge ideal of G is the Stanley-Reisner ideal of the independence complex of G. Thisis joint work with Anton Dochtermann.
QC 20100712

Style APA, Harvard, Vancouver, ISO itp.

6

Borenstein, Evan. "Additive stucture, rich lines, and exponential set-expansion". Diss., Atlanta, Ga. : Georgia Institute of Technology, 2009. http://hdl.handle.net/1853/29664.

Pełny tekst źródła

Streszczenie:

Thesis (Ph.D)--Mathematics, Georgia Institute of Technology, 2009.
Committee Chair: Croot, Ernie; Committee Member: Costello, Kevin; Committee Member: Lyall, Neil; Committee Member: Tetali, Prasad; Committee Member: Yu, XingXing. Part of the SMARTech Electronic Thesis and Dissertation Collection.

Style APA, Harvard, Vancouver, ISO itp.

7

PINTO, RONALD COUTINHO. "INTRODUCTION TO COMBINATORICS". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2014. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=24231@1.

Pełny tekst źródła

Streszczenie:

PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO
Este trabalho possui o intuito de desmistificar a dificuldade encontrada por professores e alunos no ensino e aprendizagem do tópico análise combinatória. A razão que motivou este trabalho foi o fato de que boa parte dos professores de matemática do ensino médio e últimas séries do ensino fundamental consideram a Análise Combinatória como algo complicado de ser ensinado; além da questão das dificuldades de entendimento por parte dos alunos que são induzidos à memorização de fórmulas e a aplicação das mesmas à resolução dos exercícios para compreenderem tal conteúdo. Inicialmente apresentaremos alguns conceitos que servirão como auxílio para que o professor possa trabalhar nas atividades propostas a serem desenvolvidas juntamente com os alunos. E ao longo do trabalho iremos falar de alguns tópicos abordados pela análise combinatória sem, inicialmente, mencionarmos fórmulas que servem apenas para serem memorizadas. O mais importante é fazer o aluno trabalhar um problema sugerido através do roteiro e dos conceitos que serão propostos e ao final de alguns exercícios, quando tal aluno tiver entendido tal conceito, ser anunciado a ele que acabou de aprender e entender o conceito em questão, ao invés de memorizar um determinado exercício ou outro, pois sabemos que desta forma, quando o aluno deparar-se com um novo problema, não será capaz de solucioná-lo. Dessa maneira, elaborou-se um roteiro na solução dos exercícios, ou seja, uma forma do professor trabalhar qualquer atividade proposta que envolva problemas de contagem em sala de aula. Enfim, buscou-se com esse trabalho, apresentar aos docentes, estratégias eficientes que podem ser utilizadas para o ensino de combinatória e ajudar os alunos a compreenderem melhor os problemas de contagem utilizando o raciocínio lógico e de contagem.
This work has the intent to explain the difficulties found by teachers and student on teaching and learning combinatorics. The motivation of this work was the fact that most of the Mathematics Teachers of High School consider combinatorics as something complicated to be taught; contributing as well the fact that students are led to memorize the formulas and apply it on exercises so they can understand the subject. Initially we will show some concepts that will help the Teachers to work together with the students on the proposed activities. During the work, we will talk about Combinatorics topics without mentioning formulas that needs memorization only. The most important thing is to make the student work on a suggested problem following a guide and concepts shown and after finishing a few exercises, when the student will show the understanding of the concepts, the Teacher will tell him that he learned that concept, instead of memorizing a specific exercise. Because we know that not doing this, when this student faces a new problem, he will not be able to solve it. Thus it was elaborated a guide to solve exercises and that means a way that the Teacher can work with any proposed activity that has counting in it. Finally, it was sought with this work to show the scholars some efficient strategies that can be used on teaching Combinatorics and help the students to understand better the problems about counting, using logical reasoning and logical counting.

Style APA, Harvard, Vancouver, ISO itp.

8

Brunk, Fiona. "Intersection problems in combinatorics". Thesis, St Andrews, 2009. http://hdl.handle.net/10023/765.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Redelmeier, Daniel. "Hyperpfaffians in Algebraic Combinatorics". Thesis, University of Waterloo, 2006. http://hdl.handle.net/10012/1055.

Pełny tekst źródła

Streszczenie:

The pfaffian is a classical tool which can be regarded as a generalization of the determinant. The hyperpfaffian, which was introduced by Barvinok, generalizes the pfaffian to higher dimension. This was further developed by Luque, Thibon and Abdesselam. There are several non-equivalent definitions for the hyperpfaffian, which are discussed in the introduction of this thesis. Following this we examine the extension of the Matrix-Tree theorem to the Hyperpfaffian-Cactus theorem by Abdesselam, proving it without the use of the Grassman-Berezin Calculus and with the new terminology of the non-uniform hyperpfaffian. Next we look at the extension of pfaffian orientations for counting matchings on graphs to hyperpfaffian orientations for counting matchings on hypergraphs. Finally pfaffian rings and ideal s are extended to hyperpfaffian rings and ideals, but we show that under reason able assumptions the algebra with straightening law structure of these rings cannot be extended.

Style APA, Harvard, Vancouver, ISO itp.

10

Sanders, Tom. "Topics in arithmetic combinatorics". Thesis, University of Cambridge, 2007. https://www.repository.cam.ac.uk/handle/1810/236994.

Pełny tekst źródła

Streszczenie:

This thesis is chiefly concerned with a classical conjecture of Littlewood's regarding the L¹-norm of the Fourier transform, and the closely related idem-potent theorem. The vast majority of the results regarding these problems are, in some sense, qualitative or at the very least infinitary and it has become increasingly apparent that a quantitative state of affairs is desirable. Broadly speaking, the first part of the thesis develops three new tools for tackling the problems above: We prove a new structural theorem for the spectrum of functions in A(G); we extend the notion of local Fourier analysis, pioneered by Bourgain, to a much more general structure, and localize Chang's classic structure theorem as well as our own spectral structure theorem; and we refine some aspects of Freiman's celebrated theorem regarding the structure of sets with small doubling. These tools lead to improvements in a number of existing additive results which we indicate, but for us the main purpose is in application to the analytic problems mentioned above. The second part of the thesis discusses a natural version of Littlewood's problem for finite abelian groups. Here the situation varies wildly with the underlying group and we pay special attention first to the finite field case (where we use Chang's Theorem) and then to the case of residues modulo a prime where we require our new local structure theorem for A(G). We complete the consideration of Littlewood's problem for finite abelian groups by using the local version of Chang's Theorem we have developed. Finally we deploy the Freiman tools along with the extended Fourier analytic techniques to yield a fully quantitative version of the idempotent theorem.

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Książki na temat "Combinatorics"

1

Mladenović, Pavle. Combinatorics. Cham: Springer International Publishing, 2019. http://dx.doi.org/10.1007/978-3-030-00831-4.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Merris, Russell. Combinatorics. Boston: PWS Pub. Co., 1996.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

A, Hajnal, Lovász László 1948-, Sós Vera T i Hungarian Colloquium on Combinatorics (7th : 1987 : Eger, Hungary), red. Combinatorics. Amsterdam: North-Holland Pub. Co., 1988.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Faticoni, Theodore G. Combinatorics: An introduction. Hoboken, New Jersey: Wiley, 2013.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Adhikari, S. D. Aspects of combinatorics and combinatorial number theory. Pangbourne: Alpha Science, 2002.

Znajdź pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Bajnok, Béla. Additive Combinatorics. Boca Raton : CRC Press, Taylor & Francis Group, 2018.: Chapman and Hall/CRC, 2018. http://dx.doi.org/10.1201/9781351137621.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Kashiwara, Masaki, i Tetsuji Miwa, red. Physical Combinatorics. Boston, MA: Birkhäuser Boston, 2000. http://dx.doi.org/10.1007/978-1-4612-1378-9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Stanley, Richard P. Algebraic Combinatorics. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-77173-1.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Stanley, Richard P. Enumerative Combinatorics. Boston, MA: Springer US, 1986. http://dx.doi.org/10.1007/978-1-4615-9763-6.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Stanley, Richard P. Algebraic Combinatorics. New York, NY: Springer New York, 2013. http://dx.doi.org/10.1007/978-1-4614-6998-8.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Więcej źródeł

Części książek na temat "Combinatorics"

1

Ivanov, O. A. "Combinatorics". W Easy as π?, 13–31. New York, NY: Springer New York, 1999. http://dx.doi.org/10.1007/978-1-4612-0553-1_2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Simovici, Dan A., i Chabane Djeraba. "Combinatorics". W Advanced Information and Knowledge Processing, 97–148. London: Springer London, 2014. http://dx.doi.org/10.1007/978-1-4471-6407-4_3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Sedrakyan, Hayk, i Nairi Sedrakyan. "Combinatorics". W The Stair-Step Approach in Mathematics, 75–90. Cham: Springer International Publishing, 2018. http://dx.doi.org/10.1007/978-3-319-70632-0_5.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Ubøe, Jan. "Combinatorics". W Springer Texts in Business and Economics, 41–53. Cham: Springer International Publishing, 2017. http://dx.doi.org/10.1007/978-3-319-70936-9_3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Nelson, Randolph. "Combinatorics". W Probability, Stochastic Processes, and Queueing Theory, 45–99. New York, NY: Springer New York, 1995. http://dx.doi.org/10.1007/978-1-4757-2426-4_3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Hurlbert, Glenn H. "Combinatorics". W Undergraduate Texts in Mathematics, 183–94. New York, NY: Springer New York, 2009. http://dx.doi.org/10.1007/978-0-387-79148-7_11.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Harris, John M., Jeffry L. Hirst i Michael J. Mossinghoff. "Combinatorics". W Combinatorics and Graph Theory, 129–280. New York, NY: Springer New York, 2008. http://dx.doi.org/10.1007/978-0-387-79711-3_2.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

Thomson, Norman D. "Combinatorics". W APL Programs for the Mathematics Classroom, 135–44. New York, NY: Springer New York, 1989. http://dx.doi.org/10.1007/978-1-4612-3668-9_9.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Lawler, Eugene L. "Combinatorics". W Encyclopedia of Operations Research and Management Science, 192–94. Boston, MA: Springer US, 2013. http://dx.doi.org/10.1007/978-1-4419-1153-7_132.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Lozansky, Edward, i Cecil Rousseau. "Combinatorics". W Winning Solutions, 141–213. New York, NY: Springer New York, 1996. http://dx.doi.org/10.1007/978-1-4612-4034-1_3.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Streszczenia konferencji na temat "Combinatorics"

1

DI FRANCESCO, PHILIPPE. "INTEGRABLE COMBINATORICS". W International Congress of Mathematicians 2018. WORLD SCIENTIFIC, 2019. http://dx.doi.org/10.1142/9789813272880_0151.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Ito, Masami. "Words, Languages and Combinatorics". W International Colloquium on Words, Languages and Combinatorics. WORLD SCIENTIFIC, 1992. http://dx.doi.org/10.1142/9789814538978.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Gonthier, Georges. "Combinatorics for theorem proving". W the 1st Workshop. New York, New York, USA: ACM Press, 2009. http://dx.doi.org/10.1145/1735813.1735814.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Alahmad, Mahmoud, i Wisam Nader. "Combinatorics & power consumption". W 2011 IEEE Long Island Systems, Applications and Technology Conference (LISAT). IEEE, 2011. http://dx.doi.org/10.1109/lisat.2011.5784221.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Chen, Shaoshi, i Stephen M. Watt. "Combinatorics of Hybrid Sets". W 2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC). IEEE, 2016. http://dx.doi.org/10.1109/synasc.2016.022.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Yap, H. P., T. H. Ku, E. K. Lloyd i Z. M. Wang. "Combinatorics and Graph Theory". W Proceedings of the Spring School and International Conference on Combinatorics. WORLD SCIENTIFIC, 1993. http://dx.doi.org/10.1142/9789814535342.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

Bendkowski, Maciej, i Pierre Lescanne. "Combinatorics of Explicit Substitutions". W PPDP '18: The 20th International Symposium on Principles and Practice of Declarative Programming. New York, NY, USA: ACM, 2018. http://dx.doi.org/10.1145/3236950.3236951.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

KIRILLOV, ANATOL N. "INTRODUCTION TO TROPICAL COMBINATORICS". W Proceedings of the Nagoya 2000 International Workshop. WORLD SCIENTIFIC, 2001. http://dx.doi.org/10.1142/9789812810007_0005.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

POPOV, T. "PARASTATISTICS ALGEBRAS AND COMBINATORICS". W Perspectives of the Balkan Collaborations. WORLD SCIENTIFIC, 2005. http://dx.doi.org/10.1142/9789812702166_0021.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Tung-Hsin, Ku. "Combinatorics and Graph Theory ’95". W Summer School and International Conference on Combinatorics. WORLD SCIENTIFIC, 1995. http://dx.doi.org/10.1142/9789814532495.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Raporty organizacyjne na temat "Combinatorics"

1

Chen, W. Y. C., i J. D. Louck. Combinatorics, geometry, and mathematical physics. Office of Scientific and Technical Information (OSTI), listopad 1998. http://dx.doi.org/10.2172/674871.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

2

Hanlon, Philip J., Dean Chung, Siddhartha Chatterjee, Daniel Genius, Alivn R. Lebeck i Erin Parker. The Combinatorics of Cache Misses During Matrix Multiplication. Fort Belvoir, VA: Defense Technical Information Center, marzec 2000. http://dx.doi.org/10.21236/ada448806.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

3

Srivastava, J. N. Bose Memorial Conference on Statistical Design and Related Combinatorics. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 1995. http://dx.doi.org/10.21236/ada299907.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

4

Srivastava, J. N. Bose Memorial Conference on Statistical Design and Related Combinatorics. Fort Belvoir, VA: Defense Technical Information Center, wrzesień 1995. http://dx.doi.org/10.21236/ada300029.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

5

Vu, Van H. Random Matrices, Combinatorics, Numerical Linear Algebra and Complex Networks. Fort Belvoir, VA: Defense Technical Information Center, luty 2012. http://dx.doi.org/10.21236/ada567088.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

6

Srivastava, J. Multivariate Problems of Statistics, Combinatorics, Reliability, and Signal Processing. Fort Belvoir, VA: Defense Technical Information Center, październik 1992. http://dx.doi.org/10.21236/ada265213.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

7

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

8

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

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

9

Kuhn, Richard, Raghu N. Kacker i Yu Lei. Combinatorial Coverage Measurement. Gaithersburg, MD: National Institute of Standards and Technology, październik 2012. http://dx.doi.org/10.6028/nist.ir.7878.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

10

Kuhn, D. R., R. N. Kacker i Y. Lei. Practical combinatorial testing. Gaithersburg, MD: National Institute of Standards and Technology, 2010. http://dx.doi.org/10.6028/nist.sp.800-142.

Pełny tekst źródła

Style APA, Harvard, Vancouver, ISO itp.

Oferujemy zniżki na wszystkie plany premium dla autorów, których prace zostały uwzględnione w tematycznych zestawieniach literatury. Skontaktuj się z nami, aby uzyskać unikalny kod promocyjny!