scholarly journals NORMAL CYCLIC POLYTOPES AND CYCLIC POLYTOPES THAT ARE NOT VERY AMPLE

2013 ◽  
Vol 96 (1) ◽  
pp. 61-77 ◽  
Author(s):  
TAKAYUKI HIBI ◽  
AKIHIRO HIGASHITANI ◽  
LUKAS KATTHÄN ◽  
RYOTA OKAZAKI

AbstractLet $d$ and $n$ be positive integers such that $n\geq d+ 1$ and ${\tau }_{1} , \ldots , {\tau }_{n} $ integers such that ${\tau }_{1} \lt \cdots \lt {\tau }_{n} $. Let ${C}_{d} ({\tau }_{1} , \ldots , {\tau }_{n} )\subset { \mathbb{R} }^{d} $ denote the cyclic polytope of dimension $d$ with $n$ vertices $({\tau }_{1} , { \tau }_{1}^{2} , \ldots , { \tau }_{1}^{d} ), \ldots , ({\tau }_{n} , { \tau }_{n}^{2} , \ldots , { \tau }_{n}^{d} )$. We are interested in finding the smallest integer ${\gamma }_{d} $ such that if ${\tau }_{i+ 1} - {\tau }_{i} \geq {\gamma }_{d} $ for $1\leq i\lt n$, then ${C}_{d} ({\tau }_{1} , \ldots , {\tau }_{n} )$ is normal. One of the known results is ${\gamma }_{d} \leq d(d+ 1)$. In the present paper a new inequality ${\gamma }_{d} \leq {d}^{2} - 1$ is proved. Moreover, it is shown that if $d\geq 4$ with ${\tau }_{3} - {\tau }_{2} = 1$, then ${C}_{d} ({\tau }_{1} , \ldots , {\tau }_{n} )$ is not very ample.

10.37236/319 ◽  
2010 ◽  
Vol 17 (1) ◽  
Author(s):  
Sen-Peng Eu ◽  
Tung-Shan Fu ◽  
Yeh-Jong Pan

A cyclic polytope of dimension $d$ with $n$ vertices is a convex polytope combinatorially equivalent to the convex hull of $n$ distinct points on a moment curve in ${\Bbb R}^d$. In this paper, we prove the cyclic sieving phenomenon, introduced by Reiner-Stanton-White, for faces of an even-dimensional cyclic polytope, under a group action that cyclically translates the vertices. For odd-dimensional cyclic polytopes, we enumerate the faces that are invariant under an automorphism that reverses the order of the vertices and an automorphism that interchanges the two end vertices, according to the order on the curve. In particular, for $n=d+2$, we give instances of the phenomenon under the groups that cyclically translate the odd-positioned and even-positioned vertices, respectively.


2016 ◽  
Author(s):  
David Barner

Perceptual representations – e.g., of objects or approximate magnitudes –are often invoked as building blocks that children combine with linguisticsymbols when they acquire the positive integers. Systems of numericalperception are either assumed to contain the logical foundations ofarithmetic innately, or to supply the basis for their induction. Here Ipropose an alternative to this general framework, and argue that theintegers are not learned from perceptual systems, but instead arise toexplain perception as part of language acquisition. Drawing oncross-linguistic data and developmental data, I show that small numbers(1-4) and large numbers (~5+) arise both historically and in individualchildren via entirely distinct mechanisms, constituting independentlearning problems, neither of which begins with perceptual building blocks.Specifically, I propose that children begin by learning small numbers(i.e., *one, two, three*) using the same logical resources that supportother linguistic markers of number (e.g., singular, plural). Several yearslater, children discover the logic of counting by inferring the logicalrelations between larger number words from their roles in blind countingprocedures, and only incidentally associate number words with perception ofapproximate magnitudes, in an *ad hoc* and highly malleable fashion.Counting provides a form of explanation for perception but is not causallyderived from perceptual systems.


10.37236/1729 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Graham Denham

Let $a_1,\ldots,a_n$ be distinct, positive integers with $(a_1,\ldots,a_n)=1$, and let k be an arbitrary field. Let $H(a_1,\ldots,a_n;z)$ denote the Hilbert series of the graded algebra k$[t^{a_1},t^{a_2},\ldots,t^{a_n}]$. We show that, when $n=3$, this rational function has a simple expression in terms of $a_1,a_2,a_3$; in particular, the numerator has at most six terms. By way of contrast, it is known that no such expression exists for any $n\geq4$.


10.37236/1735 ◽  
2003 ◽  
Vol 10 (1) ◽  
Author(s):  
Dhruv Mubayi ◽  
Yi Zhao

Given positive integers $n,k,t$, with $2 \le k\le n$, and $t < 2^k$, let $m(n,k,t)$ be the minimum size of a family ${\cal F}$ of nonempty subsets of $[n]$ such that every $k$-set in $[n]$ contains at least $t$ sets from ${\cal F}$, and every $(k-1)$-set in $[n]$ contains at most $t-1$ sets from ${\cal F}$. Sloan et al. determined $m(n, 3, 2)$ and Füredi et al. studied $m(n, 4, t)$ for $t=2, 3$. We consider $m(n, 3, t)$ and $m(n, 4, t)$ for all the remaining values of $t$ and obtain their exact values except for $k=4$ and $t= 6, 7, 11, 12$. For example, we prove that $ m(n, 4, 5) = {n \choose 2}-17$ for $n\ge 160$. The values of $m(n, 4, t)$ for $t=7,11,12$ are determined in terms of well-known (and open) Turán problems for graphs and hypergraphs. We also obtain bounds of $m(n, 4, 6)$ that differ by absolute constants.


2020 ◽  
pp. 77-83
Author(s):  
Mohammad Shadab Khan ◽  
Mohd Arif Raza ◽  
Nadeemur Rehman

Let R be a prime ring, I a nonzero ideal of R, d a derivation of R and m, n fixed positive integers. (i) If (d ( r ○ s)(r ○ s) + ( r ○ s) d ( r ○ s)n - d ( r ○ s))m for all r, s ϵ I, then R is commutative. (ii) If (d ( r ○ s)( r ○ s) + ( r ○ s) d ( r ○ s)n - d (r ○ s))m ϵ Z(R) for all r, s ϵ I, then R satisfies s4, the standard identity in four variables. Moreover, we also examine the case when R is a semiprime ring.


Symmetry ◽  
2021 ◽  
Vol 13 (4) ◽  
pp. 605
Author(s):  
Martin Bača ◽  
Zuzana Kimáková ◽  
Marcela Lascsáková ◽  
Andrea Semaničová-Feňovčíková

For a simple graph G with no isolated edges and at most, one isolated vertex, a labeling φ:E(G)→{1,2,…,k} of positive integers to the edges of G is called irregular if the weights of the vertices, defined as wtφ(v)=∑u∈N(v)φ(uv), are all different. The irregularity strength of a graph G is known as the maximal integer k, minimized over all irregular labelings, and is set to ∞ if no such labeling exists. In this paper, we determine the exact value of the irregularity strength and the modular irregularity strength of fan graphs.


Mathematics ◽  
2021 ◽  
Vol 9 (15) ◽  
pp. 1813
Author(s):  
S. Subburam ◽  
Lewis Nkenyereye ◽  
N. Anbazhagan ◽  
S. Amutha ◽  
M. Kameswari ◽  
...  

Consider the Diophantine equation yn=x+x(x+1)+⋯+x(x+1)⋯(x+k), where x, y, n, and k are integers. In 2016, a research article, entitled – ’power values of sums of products of consecutive integers’, primarily proved the inequality n= 19,736 to obtain all solutions (x,y,n) of the equation for the fixed positive integers k≤10. In this paper, we improve the bound as n≤ 10,000 for the same case k≤10, and for any fixed general positive integer k, we give an upper bound depending only on k for n.


2021 ◽  
Vol 71 (3) ◽  
pp. 595-614
Author(s):  
Ram Krishna Pandey ◽  
Neha Rai

Abstract For a given set M of positive integers, a well-known problem of Motzkin asks to determine the maximal asymptotic density of M-sets, denoted by μ(M), where an M-set is a set of non-negative integers in which no two elements differ by an element in M. In 1973, Cantor and Gordon find μ(M) for |M| ≤ 2. Partial results are known in the case |M| ≥ 3 including some results in the case when M is an infinite set. Motivated by some 3 and 4-element families already discussed by Liu and Zhu in 2004, we study μ(M) for two families namely, M = {a, b,a + b, n(a + b)} and M = {a, b, b − a, n(b − a)}. For both of these families, we find some exact values and some bounds on μ(M). This number theory problem is also related to various types of coloring problems of the distance graphs generated by M. So, as an application, we also study these coloring parameters associated with these families.


1998 ◽  
Vol 5 (6) ◽  
pp. 545-564
Author(s):  
G. Lomadze

Abstract A way of finding exact explicit formulas for the number of representations of positive integers by quadratic forms in 12 variables with integral coefficients is suggested.


Sign in / Sign up

Export Citation Format

Share Document