Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
From MaRDI portal
Publication:2645775
DOI10.1007/BF02546665zbMath0017.23202WikidataQ29543624 ScholiaQ29543624MaRDI QIDQ2645775
Publication date: 1937
Published in: Acta Mathematica (Search for Journal in Brave)
Related Items
The transformation and analysis of networks by means of computer algorithms, Hierarchical enumeration of Kekulé's benzenes, Ladenburg's benzenes, Dewar's benzenes, and benzvalenes by using combined-permutation representations, Quasisymmetric and Schur expansions of cycle index polynomials, Multisets of Aperiodic Cycles, Signatures of extremal 2-unifrom hypergraphs, A note on 'pattern variants on a square field', Permutation invariant Gaussian two-matrix models, Permutational isomers on a molecular skeleton with neighbor-excluding ligands, The enumeration of rooted trees by total height, On symmetries in phylogenetic trees, The number of plane trees with a given partition, Survival under random coverings of trees, Algebraic solution for the numbers of staggered conformers of alkanes, The enumeration of tree-like polyhexes, Iterates of generic polynomials and generic rational functions, Variations on the Ising problem, On solving equations of algebraic sum of equal powers, The number of d ‐polytopes with d +3 vertices, On partitions of functions on finite sets, In the footsteps of Euler and MacMahon: combinatorics, the mathematics that counts, The convolution ring of arithmetic functions and symmetric polynomials, On digraphs with circulant adjacent matrices, A simplicial groupoid for plethysm, Explicit representations for local Lagrangian numerical differentiation, Importance of the proligand-promolecule model in stereochemistry. I: The unit-subduced-cycle-index (USCI) approach to geometric features of prismane derivatives, Point configurations on the projective line over a finite field, Order polynomials and Pólya's enumeration theorem., Topological actions of wreath products, Plethysms and operads, Isolated Rupture in Thorny Networks, Scaling Limits of Markov-Branching Trees and Applications, Vertex nomination schemes for membership prediction, A quantitative study of pure parallel processes, An algebraic representation of graphs and applications to graph enumeration, Hierarchical enumeration of octahedral complexes by using combined-permutation representations, Counting glycans revisited, Combinatorial enumeration of three-dimensional trees as stereochemical models of alkanes: An approach based on Fujita's proligand method and dual recognition as uninuclear and binuclear promolecules, Point-color-symmetric graphs with a prime number of vertices, A complexity calculus for recursive tree algorithms, Unnamed Item, Enumeration of bipartite self-complementary graphs, Enumerations, forbidden subgraph characterizations, and the split-decomposition, Low-degree factors of random polynomials, Counting finite models, Unnamed Item, On unretractive graphs, Classification of all associative mono-\(n\)-ary algebras with 2 elements, Efficient enumeration of stereoisomers of tree structured molecules using dynamic programming, Partitions of a finite set into structured subsets, Combinatorial enumeration of ethane derivatives as three-dimensional chemical structures, not as graphs. A systematic approach for enumerating and characterizing stereoisomers of tartaric acids and related compounds, The shape of unlabeled rooted random trees, An Efficient Method of Examining all Trees, Multilinear techniques in pólya enumeration theory, On the two kinds of probability in algebra, On the Hermite interpolation, An Application of Polya's Enumeration Theorem to Partitions of Subsets of Positive Integers, Sur les types des propositions composées, Precise asymptotics of longest cycles in random permutations without macroscopic cycles, Recursion and growth estimates in renormalizable quantum field theory, Nonlocality in many-body quantum systems detected with two-body correlators, Maximum antichains in the partition lattice, Coherent States in Fermionic Fock-Krein Spaces and Their Amplitudes, Path node-covering constants for certain families of trees, The probability that a point of a tree is fixed, PSEM approximations for both branches of Lambert \(W\) function with applications, Kombinatorische Anzahlbestimmungen in Relationen, A detachment algorithm for inferring a graph from path frequency, The number of graphs on many unlabelled nodes, Tone rows and tropes, On Fluctuations and the General Distribution Problem in Electron Cascades, Die Anzahl nicht-isomorpher \(m\)-Graphen, Improved Explicit Data Structures in the Bit-Probe Model Using Error-Correcting Codes, On the Lambert \(w\) function, A model with persistent vacuum, Graphs on unlabelled nodes with a given number of edges, On the distribution of winning moves in random game trees, RECONSTRUCTABILITY ANALYSIS OF MULTI-DIMENSIONAL RELATIONS: A Theoretical Basis for Computer-Aided Determination of Acceptable Systems Models †, On the Redfield-Read combinatory algorithm, Enumerating Types of Boolean Functions, The numbers of labeled colored and chromatic trees, The number of homeomorphically irreducible trees, and other species, The number of functional digraphs, Enumeration under two representations of the wreath product, The average number of cycles., Reflections on symmetric polynomials and arithmetic functions, Automorphisms of types in certain type theories and representation of finite groups, An iteration method with maximal order based on standard information, Tensors and Graphs, Topological and analytical classification of vector fields with only isochronous centres, The geometry of stable quotients in genus one, Total Positivity from the Exponential Riordan Arrays, Asymmetric and symmetric graphs, Numerical Algorithm for Pólya Enumeration Theorem, Enumeration of self‐converse digraphs, The number of simplicial neighbourly d ‐polytopes with d +3 vertices, On acyclic simplicial complexes
