minimal integer
Recently Published Documents

Weighted committees allow shareholders, party leaders, etc. to wield different numbers of votes or voting weights as they decide between multiple candidates by a given social choice method. We consider committees that apply scoring methods such as plurality, Borda, or antiplurality rule. Many different weights induce the same mapping from committee members’ preferences to winning candidates. The numbers of respective weight equivalence classes and hence of structurally distinct plurality committees, Borda commitees, etc. differ widely. There are 6, 51, and 5 plurality, Borda, and antiplurality committees, respectively, if three players choose between three candidates and up to 163 (229) committees for scoring rules in between plurality and Borda (Borda and antiplurality). A key implication is that plurality, Borda, and antiplurality rule are much less sensitive to weight changes than other scoring rules. We illustrate the geometry of weight equivalence classes, with a map of all Borda classes, and identify minimal integer representations.

Collatz conjecture is also known as 3X + 1 conjecture. For verifying the conjecture, we designed an algorithm that can output reduced dynamics (occurred 3 × x+1 or x/2 computations from a starting integer to the first integer smaller than the starting integer) and original dynamics of integers (from a starting integer to 1). Especially, the starting integer has no upper bound. That is, extremely large integers with length of about 100,000 bits, e.g., 2100000 − 1, can be verified for Collatz conjecture, which is much larger than current upper bound (about 260). We analyze the properties of those data (e.g., reduced dynamics) and discover the following laws; reduced dynamics is periodic and the period is the length of its reduced dynamics; the count of x/2 equals to minimal integer that is not less than the count of (3 × x + 1)/2 times ln(1.5)/ln(2). Besides, we observe that all integers are partitioned regularly in half and half iteratively along with the prolonging of reduced dynamics, thus given a reduced dynamics we can compute a residue class that presents this reduced dynamics by a proposed algorithm. It creates one-to-one mapping between a reduced dynamics and a residue class. These observations from data can reveal the properties of reduced dynamics, which are proved mathematically in our other papers (see references). If it can be proved that every integer has reduced dynamics, then every integer will have original dynamics (i.e., Collatz conjecture will be true). The data set includes reduced dynamics of all odd positive integers in [3, 99999999] whose remainder is 3 when dividing 4, original dynamics of some extremely large integers, and all computer source codes in C that implement our proposed algorithms for generating data (i.e., reduced or original dynamics).

Let S be an antinegative semiring. The rank of an m × n matrix B over S is the minimal integer r such that B is a product of an m × r matrix and an r × n matrix. The isolation number of B is the maximal number of nonzero entries in the matrix such that no two entries are in the same column, in the same row, and in a submatrix of B of the form b i , j b i , l b k , j b k , l with nonzero entries. We know that the isolation number of B is not greater than the rank of it. Thus, we investigate the upper bound of the rank of B and the rank of its support for the given matrix B with isolation number h over antinegative semirings.

Let X⊂ℙr be an integral and nondegenerate variety. Let c be the minimal integer such that ℙr is the c-secant variety of X, that is, the minimal integer c such that for a general O∈ℙr there is S⊂X with #(S)=c and O∈〈S〉, where 〈 〉 is the linear span. Here we prove that for every P∈ℙr there is a zero-dimensional scheme Z⊂X such that P∈〈Z〉 and deg(Z)≤2c; we may take Z as union of points and tangent vectors of Xreg.

Let n be an arbitrary integer, let p be a prime factor of n . Denote by ω1 the pth primitive unity root, \documentclass{aastex} \usepackage{amsbsy} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{bm} \usepackage{mathrsfs} \usepackage{pifont} \usepackage{stmaryrd} \usepackage{textcomp} \usepackage{upgreek} \usepackage{portland,xspace} \usepackage{amsmath,amsxtra} \usepackage{bbm} \pagestyle{empty} \DeclareMathSizes{10}{9}{7}{6} \begin{document} $$\omega _1 : = e^{\tfrac{{2\pi i}} {p}}$$ \end{document}.Define ωi ≔ ω1i for 0 ≦ i ≦ p − 1 and B ≔ {1, ω1 , …, ωp −1 } n ⊆ ℂ n .Denote by K ( n; p ) the minimum k for which there exist vectors ν1 , …, νk ∈ B such that for any vector w ∈ B , there is an i , 1 ≦ i ≦ k , such that νi · w = 0, where ν · w is the usual scalar product of ν and w .Gröbner basis methods and linear algebra proof gives the lower bound K ( n; p ) ≧ n ( p − 1).Galvin posed the following problem: Let m = m ( n ) denote the minimal integer such that there exists subsets A1 , …, Am of {1, …, 4 n } with | Ai | = 2 n for each 1 ≦ i ≦ n , such that for any subset B ⊆ [4 n ] with 2 n elements there is at least one i , 1 ≦ i ≦ m , with Ai ∩ B having n elements. We obtain here the result m ( p ) ≧ p in the case of p > 3 primes.

AbstractPointwise bounds for characters of representations of the classical, compact, connected, simple Lie groups are obtained with which allow us to study the singularity of central measures. For example, we find the minimal integer k such that any continuous orbital measure convolved with itself k times belongs to L2. We also prove that if k = rank G then μ 2k ∈ L1 for all central, continuous measures μ. This improves upon the known classical result which required the exponent to be dimension of the group G.