4 Dima Z

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859
Across
  1. 4. is a vertex of flow network, where flow ends.
  2. 5. point is a 1-citcuit in permutation.
  3. 6. is a first derivative of coordinate function.
  4. 8. is a function, which shows how fast first function grows.
  5. 10. is a set of vertices of flow network, which has source and hasn’t sink.
  6. 11. is a sequence of vertices and edges.
  7. 14. J(n, r) = KG(n, r, r - 1).
  8. 15. is a permutation, which moves some element in cycle and doesn’t move others.
  9. 17. is function beetwen elements of two sets where every element of one set is paired with exactly one element of the other set, and every element of the other set is paired with exactly one element of the first set.
  10. 19. is an algebra with four operations: addition, multiplication, subtraction and division.
  11. 21. is a parity of amount of inversions of this permutation.
  12. 24. D(G) is a maximal eccenticity of vertices.
  13. 25. is the tendency of a force to rotate an object about an axis.
  14. 27. is a element of V.
  15. 29. is a group which is a set of normal subgroups of group with special operation.
  16. 30. is a second derivative of coordinate function.
  17. 32. is a vertex of flow network, where flow begins.
  18. 33. is any nonempty subset of V.
  19. 37. are function from first group to second retaining structure.
  20. 39. is a distribution of binomial random variable.
  21. 40. is a graph without circuits.
  22. 41. measures how far a set of numbers is spread out.
  23. 42. is a graph whose can be divided into some independent sets.
  24. 43. is a bijective homomorphism.
  25. 46. is a set of all pairs of two sets, where first element of pair in first set and second is in second set.
  26. 48. are set without common elements.
  27. 50. is a minimal number such, that permutation in this power is equal to identity permutation.
  28. 51. is an integral of force.
  29. 52. is a closured algebraic structure with associative operation and identity element.
  30. 53. is a graph whose vertices can be divided into two independent sets.
  31. 54. is a permutation, which is equivalent to its inverse permutation.
  32. 55. is a pair (i, j) of elements of permutation a such, that i<j and a(i)>a(j).
  33. 58. is a commutative group.
  34. 59. trail, in which first and last vertices are same.
Down
  1. 1. KG(n, r) = KG(n, r, 0).
  2. 2. is a element of E.
  3. 3. is a graph, in which any pair of vertices connected by one edge.
  4. 7. is a peace of plane limited by edges.
  5. 8. is a permutation without fixed points.
  6. 9. is a area under a curve.
  7. 12. is a graph without edges.
  8. 13. is an algebraic structure with addition and multiplication with same axioms.
  9. 16. is permutation such, that its and permutations composition gives identity permutation.
  10. 18. is a connected graph without circuits.
  11. 20. is an average value of a random variable.
  12. 22. is a isomorphism from group to itself.
  13. 23. is 2-ciclic permutation.
  14. 26. is a graph, whose edges can connect more than two vertices.
  15. 28. is a walk in which all edges are different.
  16. 31. e(v) is a largest distance between v and any other vertex.
  17. 34. G(V, E) is a pair of sets V, E, where E is subset of P(V).
  18. 35. is a operatin on group G: a^-1*x*a.
  19. 36. shows, which values likely will give random variable.
  20. 38. is a graph with loops or parallel edges.
  21. 40. is a vector quantity, which changes motion of an object.
  22. 44. is a bijective function from set {1,..., n} to itself.
  23. 45. is a subgroup which is an invariant under conjugation.
  24. 47. are vertices connected by edge.
  25. 49. is a edge that connects vertex to itself.
  26. 56. is element which doesn’t change other elements when combained with whem.
  27. 57. R(G) is a minimal eccenticity of vertices.