Results 21 to 30 of about 101,656 (166)
Some remarks on multiplicity codes
, 2014 Multiplicity codes are algebraic error-correcting codes generalizing classical polynomial evaluation codes, and are based on evaluating polynomials and their derivatives.
Kopparty, Swastik
core +1 more source
On Kotzig's Perfect Set Problem of Hamiltonian Cycle Decompositions of the Complete Graph
Journal of Combinatorial Designs, EarlyView.ABSTRACT A Hamiltonian cycle decomposition (HCD) of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 1‐path of K n ${K}_{n}$ appears exactly once. A Dudeney set of K n ${K}_{n}$ is a set of Hamiltonian cycles in which each 2‐path of K n ${K}_{n}$ appears exactly once.
Nobuaki Mutoh
wiley +1 more source
Noncommutative Bell polynomials, quasideterminants and incidence Hopf algebras
, 2014 Bell polynomials appear in several combinatorial constructions throughout mathematics. Perhaps most naturally in the combinatorics of set partitions, but also when studying compositions of diffeomorphisms on vector spaces and manifolds, and in the study ...
Ebrahimi-Fard, Kurusch +2 more
core +3 more sources
Colourings of Uniform Group Divisible Designs and Maximum Packings
Journal of Combinatorial Designs, EarlyView.ABSTRACT A weak c $c$‐colouring of a design is an assignment of colours to its points from a set of c $c$ available colours, such that there are no monochromatic blocks. A colouring of a design is block‐equitable, if for each block, the number of points coloured with any available pair of colours differ by at most one.
Andrea C. Burgess +6 more
wiley +1 more source
Beck's Conjecture for Power Graphs [PDF]
, 2014 Beck's conjecture on coloring of graphs associated to various algebraic objects has generated considerable interest in the community of discrete mathematics and combinatorics since its inception in the year 1988.
Das, Priya, Mukherjee, Himadri
core
Peak reduction technique in commutative algebra
, 1999 The "peak reduction" method is a powerful combinatorial technique with applications in many different areas of mathematics as well as theoretical computer science.
D Wright +11 more
core +2 more sources
Transforming Solutions for the Oberwolfach Problem into Solutions for the Spouse‐Loving Variant
Journal of Combinatorial Designs, EarlyView.ABSTRACT The Oberwolfach problem OP ( F ) $\mathrm{OP}(F)$, for a 2‐factor F $F$ of K n ${K}_{n}$, asks whether there exists a 2‐factorization of K n ${K}_{n}$ (if n $n$ is odd) or K n − I ${K}_{n}-I$ (if n $n$ is even) where each 2‐factor is isomorphic to F $F$. Here, I $I$ denotes any 1‐factor of K n ${K}_{n}$. For even n $n$, the problem OP( F ) $(F)
Maruša Lekše, Mateja Šajna
wiley +1 more source
Transitive factorizations of permutations and geometry [PDF]
, 2014 We give an account of our work on transitive factorizations of permutations. The work has had impact upon other areas of mathematics such as the enumeration of graph embeddings, random matrices, branched covers, and the moduli spaces of curves.
Goulden, I. P., Jackson, D. M.
core
A Euclid style algorithm for MacMahon's partition analysis
, 2015 Solutions to a linear Diophantine system, or lattice points in a rational convex polytope, are important concepts in algebraic combinatorics and computational geometry. The enumeration problem is fundamental and has been well studied, because it has many
Aardal +24 more
core +1 more source
A Study On Combinatorics Indiscrete Mathematics
, 2018 {"references": ["1.\tArumugam. S & Isaac. A. T, \"Modern Algebra\", Scitech Publications Pvt. Ltd, Chennai. 2.\tLiu. C. L \"Elements of Discrete Mathematics\", MC Graw Hill, Internation Edition. 3.\tTremblay. J. P & Manohar. R, \"Discrete Mathematics Structure with application to computer science\", TMH Edition 1007. 4.\tVeerarajan.
G. Rajkumar, Dr. V. Ramadoss
openaire +2 more sources