scientific article; zbMATH DE number 686998
From MaRDI portal
Publication:4313087
Recommendations
Cited in
(only showing first 100 items - show all)- Homogeneous factorisations of complete graphs with edge-transitive factors
- Parity patterns associated with lifts of Hecke groups.
- On the class of \(t\)-designs
- On the extendability of code isometries
- Searching with mobile agents in networks with liars.
- The automorphism groups of Steiner triple systems obtained by the Bose construction
- Reduced Gröbner bases, free difference-differential modules and difference-differential dimension polynomials
- Factorization of de Bruijn digraphs by cycle-rooted trees
- BPS operators in \( \mathcal{N}=4 \) SO(\(N\)) super Yang-Mills theory: plethysms, dominoes and words
- Trees, paths, stars, caterpillars and spiders
- Counting and construction of holomorphic primary fields in free CFT4 from rings of functions on Calabi-Yau orbifolds
- Modeling value disagreement
- The combinatorial \(k\)-deck
- Balanced colourings of strongly regular graphs
- Extremal problems for sets forming Boolean algebras and complete partite hypergraphs
- Generalized Fermat, double Fermat and Newton sequences.
- Towards a language theory for infinite N-free pomsets.
- Generalized \(O\)-sequences and Hilbert functions of points
- Complete voting systems with two classes of voters: weightedness and counting
- The universal Glivenko-Cantelli property
- The entropy of graded algebras
- Computation of Hilbert polynomials in two variables
- The spectrum of permutation orbifolds
- Computing the spark: mixed-integer programming for the (vector) matroid girth problem
- Fixed points of a random restricted growth sequence
- The large \(N\) limit of orbifold vertex operator algebras
- Hierarchical Aitchison-Silvey models for incomplete binary sample spaces
- On the enumeration of integer tetrahedra
- On the complexity of singly connected vertex deletion
- Petrie symmetric functions
- Poissonian correlations of higher orders
- The localization capture time of a graph
- Fixed points and matching points in partitions
- On the subspace choosability in graphs
- Isometries between finite groups
- Randomized probe selection algorithm for microarray design
- 1-overlap cycles for Steiner triple systems
- Algorithms for enumeration problem of linear congruence modulo \(m\) as sum of restricted partition numbers
- DNA codes for nonadditive stem similarity
- Are induction and well-ordering equivalent?
- An extended strange planet protocol
- An introduction to associative geometry with applications to integrable systems
- A non-Schurian coherent configuration on 14 points exists
- Brill-Noether theory of squarefree modules supported on a graph
- More odd graph theory from another point of view
- A Gaussian inequality for expected absolute products
- A note on partition sum polynomials
- An efficient algorithm for multi-hoist cyclic scheduling with fixed processing times
- Product action.
- On the construction of restricted-denominator exponential W-methods
- Clique coverings and partitions of line graphs
- Sieve methods in combinatorics
- Tags on subsets
- Mediated digraphs and quantum nonlocality
- Elliptic multiple zeta values and one-loop superstring amplitudes
- Bell inequalities for \(S_4\) group: classical and quantum bounds for two-orbit case
- A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs
- Explicit multi-matrix topological expansion for quaternionic random matrices
- On supermultiplet twisting and spin-statistics
- A combinatorial algorithm for all-pairs shortest paths in directed vertex-weighted graphs with applications to disc graphs
- Pascal matrices and Stirling numbers
- The value of the two cable ambush game
- The two-machine no-wait general and proportionate open shop makespan problem
- Further Results on Two Families of Nanostructures
- Quivers as calculators: counting, correlators and Riemann surfaces
- Graph-theoretic design and analysis of key predistribution schemes
- Extremal combinatorics. With applications in computer science
- Some combinatorial properties of the symmetric monoid.
- scientific article; zbMATH DE number 425392 (Why is no real title available?)
- scientific article; zbMATH DE number 431984 (Why is no real title available?)
- scientific article; zbMATH DE number 2134025 (Why is no real title available?)
- Jacobi's triple product, mock theta functions, unimodal sequences and the q-bracket
- scientific article; zbMATH DE number 3877179 (Why is no real title available?)
- The doctrine of triangles. A history of modern trigonometry
- Enumerating Types of Boolean Functions
- Opening the door
- On the Ramsey-Turán number with small s-independence number
- Chordal and timbral morphologies using Hamiltonian cycles
- Combinatorics. A guided tour
- scientific article; zbMATH DE number 3935040 (Why is no real title available?)
- scientific article; zbMATH DE number 3957110 (Why is no real title available?)
- scientific article; zbMATH DE number 4035837 (Why is no real title available?)
- scientific article; zbMATH DE number 4081562 (Why is no real title available?)
- Some approaches for solving the general (t,k)-design existence problem and other related problems
- The generic representation theory of the Juyumaya algebra of braids and ties.
- Flipping triangles and rectangles
- scientific article; zbMATH DE number 46849 (Why is no real title available?)
- scientific article; zbMATH DE number 51878 (Why is no real title available?)
- scientific article; zbMATH DE number 1250163 (Why is no real title available?)
- Finite Variable Logics in Descriptive Complexity Theory
- scientific article; zbMATH DE number 1324671 (Why is no real title available?)
- Remoteness of permutation codes
- scientific article; zbMATH DE number 1016990 (Why is no real title available?)
- Characteristic polynomials of finitely generated modules over Weyl algebras
- scientific article; zbMATH DE number 1792682 (Why is no real title available?)
- A note on Gaussian series rings
- On generalized Ramsey numbers of Erdős and Rogers
- Combinatorics: the mathematics that counts. II.
- The number of circuits of length 4 in \(\mathrm{PSL}(2,\mathbb{Z})\)-space
- scientific article; zbMATH DE number 3999928 (Why is no real title available?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4313087)
