• In mathematics, a set of natural numbers is called a K-trivial set if its initial segments viewed as binary strings are easy to describe: the prefix-free...
    11 KB (1,837 words) - 21:27, 19 September 2023
  • the notion of a K-trivial set. These sets are anti-random in that all initial segment is logarithmically compressible (i.e., K ( w ) ≤ K ( | w | ) + b {\displaystyle...
    33 KB (4,904 words) - 17:35, 14 July 2025
  • Thumbnail for Divisor
    Divisor (redirect from Trivial divisor)
    factor of 42. The non-trivial divisors of 6 are 2, −2, 3, −3. The positive divisors of 42 are 1, 2, 3, 6, 7, 14, 21, 42. The set of all positive divisors...
    12 KB (1,858 words) - 05:16, 17 July 2025
  • K {\displaystyle K} if the elements of S {\displaystyle S} do not satisfy any non-trivial polynomial equation with coefficients in K {\displaystyle K}...
    7 KB (946 words) - 17:06, 18 January 2025
  • Thumbnail for Kakeya set
    Therefore, there is at least one non-trivial polynomial of degree less than |F| that vanishes on any given set with less than this number of points....
    30 KB (3,684 words) - 04:06, 21 July 2025
  • Thumbnail for Vector bundle
    trivial bundle of rank k {\displaystyle k} over X {\displaystyle X} . Given a vector bundle E → X {\displaystyle E\to X} of rank k {\displaystyle k}...
    31 KB (4,093 words) - 15:29, 27 June 2025
  • algebraic number field K {\displaystyle K} is the quotient group J K / P K {\displaystyle J_{K}/P_{K}} where J K {\displaystyle J_{K}} is the group of fractional...
    14 KB (2,326 words) - 00:31, 20 April 2025
  • include permutations with fixed points in addition to at most one non-trivial cycle. In cycle notation, cyclic permutations are denoted by the list of...
    13 KB (2,032 words) - 18:28, 20 June 2025
  • Thumbnail for Connectivity (graph theory)
    X | : X  is a non-trivial cutset } . {\displaystyle \kappa _{1}(G)=\min\{|X|:X{\text{ is a non-trivial cutset}}\}.} A non-trivial edge-cut and the...
    17 KB (2,062 words) - 23:37, 25 March 2025
  • Thumbnail for Group action
    Group action (redirect from Trivial action)
    a field extension L / K acts on the field L but has only a trivial action on elements of the subfield K. Subgroups of Gal(L / K) correspond to subfields...
    46 KB (5,742 words) - 17:46, 24 May 2025
  • Thumbnail for Direct sum of groups
    called the direct sum of a finite set of subgroups {Hi} if each Hi is a normal subgroup of G, each Hi has trivial intersection with the subgroup ⟨{Hj :...
    8 KB (1,041 words) - 18:20, 15 October 2024
  • kombinatorischen Logik, whose results are set out in Curry (1930). It has expressive power equivalent to that of S, K, I system. Both systems are fully interchangeable...
    6 KB (703 words) - 02:38, 24 March 2025
  • Thumbnail for Frobenius group
    transitive permutation group on a finite set, such that no non-trivial element fixes more than one point and some non-trivial element fixes a point. They are named...
    9 KB (1,272 words) - 02:20, 11 July 2025
  • algebraic variety. The earliest work on a non-trivial Grassmannian is due to Julius Plücker, who studied the set of projective lines in real projective 3-space...
    48 KB (8,402 words) - 01:23, 16 July 2025
  • implies trivially that (b, –a) is a linear relation between a and b. Therefore, given a generating set g 1 , … , g k {\displaystyle g_{1},\dots ,g_{k}} of...
    13 KB (2,345 words) - 08:29, 8 July 2024
  • j, −j, k, −k}, is {1, −1}. The center of the symmetric group, Sn, is trivial for n ≥ 3. The center of the alternating group, An, is trivial for n ≥ 4...
    12 KB (1,189 words) - 19:22, 28 May 2025
  • Thumbnail for Partition of a set
    partition.) For any non-empty set X, P = { X } is a partition of X, called the trivial partition. Particularly, every singleton set {x} has exactly one partition...
    14 KB (1,878 words) - 01:18, 31 May 2025
  • Thumbnail for Convex set
    {\displaystyle C} itself and the empty set are faces of C {\displaystyle C} ; these are sometimes called the trivial faces of C {\displaystyle C} . An extreme...
    27 KB (3,429 words) - 17:52, 10 May 2025
  • departmentID} is the trivial superkey. If attribute set K is a superkey of relation R, then at all times it is the case that the projection of R over K has the same...
    5 KB (555 words) - 01:00, 25 May 2025
  • Thumbnail for Independent set (graph theory)
    maximum independent set; therefore, this trivial algorithm attains a (d − 1)-approximation algorithm for the maximum independent set. In fact, it is possible...
    30 KB (3,564 words) - 07:50, 15 July 2025
  • Thumbnail for Riemann zeta function
    k 1 > k 2 > ⋯ > k n > 0 k 1 − s 1 k 2 − s 2 ⋯ k n − s n . {\displaystyle \zeta (s_{1},s_{2},\ldots ,s_{n})=\sum _{k_{1}>k_{2}>\cdots >k_{n}>0}{k...
    74 KB (10,718 words) - 01:21, 7 July 2025
  • unlike APL, K restricts itself to the ASCII character set (as does another APL variant, J). To allow for this, the set of primitive functions for K is smaller...
    10 KB (1,222 words) - 11:17, 13 February 2025
  • because of the covering set {7, 13, 31, 37, 97}. Besides, these k are not trivial since gcd(k + 1, 6 − 1) = 1 for these k. (The Riesel base 6 conjecture...
    23 KB (1,885 words) - 00:58, 11 July 2025
  • Thumbnail for Fiber bundle
    Fiber bundle (redirect from Trivial bundle)
    the product space to the first factor. This is called a trivial bundle. Examples of non-trivial fiber bundles include the Möbius strip and Klein bottle...
    29 KB (4,152 words) - 08:22, 17 July 2025
  • product of a set KK {\displaystyle K\subseteq \mathbb {K} } of scalars with a set A {\displaystyle A} of vectors as K A = { k a : kK , a ∈ A } ,...
    40 KB (7,720 words) - 21:39, 22 May 2024
  • follows: (S (K (S I)) (S (K K) I) x y) = (K (S I) x (S (K K) I x) y) = (S I (S (K K) I x) y) = (I y (S (K K) I x y)) = (y (S (K K) I x y)) = (y (K K x (I x)...
    42 KB (5,301 words) - 11:48, 17 July 2025
  • Thumbnail for Tangent bundle
    bundle is trivial. By definition, a manifold M {\displaystyle M} is framed if and only if the tangent bundle T M {\displaystyle TM} is stably trivial, meaning...
    17 KB (2,949 words) - 23:44, 2 May 2025
  • Thumbnail for Binomial coefficient
    the trivial coefficients, would be. A more efficient method to compute individual binomial coefficients is given by the formula ( n k ) = n k _ k ! =...
    62 KB (10,790 words) - 13:49, 8 July 2025
  • coarsest topology on X is the trivial topology; this topology only admits the empty set and the whole space as open sets. In function spaces and spaces...
    7 KB (995 words) - 02:08, 27 April 2025
  • The Trivial File Transfer Protocol (TFTP) is a simple lockstep communication protocol for transmitting or receiving files in a client-server application...
    15 KB (1,750 words) - 00:03, 21 March 2025