arXiv subjects
Publications and source records attributed to Yi Ouyang.
For prime $p\equiv-1\bmod d$ and $q$ a power of $p$, we obtain the slopes of the $q$-adic Newton polygons of $L$-functions of $x^d+ax^{d-1}\in \mathbb{F}_q[x]$ with respect to finite characters $χ$ when $p$ is larger than an explicit bound depending only on $d$ and $\log_p q$. The main tools are Dwork's trace formula and Zhu's rigid transform theorem.
We show that for a monic polynomial $f(x)$ over a number field $K$ containing a global permutation polynomial of degree $>1$ as its composition factor, the Newton Polygon of $f\mod\mathfrak p$ does not converge for $\mathfrak p$ passing through all finite places of $K$. In the rational number field case, our result is the "only if" part of a conjecture of Wan about limiting Newton polygons.
We formulate and analyze a general class of stochastic dynamic games with asymmetric information arising in dynamic systems. In such games, multiple strategic agents control the system dynamics and have different information about the system over time. Because of the presence of asymmetric information, each agent needs to form beliefs about other agents' private information. Therefore, the specification of the agents' beliefs along with their strategies is necessary to study the dynamic game. We use Perfect Bayesian equilibrium (PBE) as our solution concept. A PBE consists of a pair of strategy profile and belief system. In a PBE, every agent's strategy should be a best response under the belief system, and the belief system depends on agents' strategy profile when there is signaling among agents. Therefore, the circular dependence between strategy profile and belief system makes it difficult to compute PBE. Using the common information among agents, we introduce a subclass of PBE called common information based perfect Bayesian equilibria (CIB-PBE), and provide a sequential decomposition of the dynamic game. Such decomposition leads to a backward induction algorithm to compute CIB-PBE. We illustrate the sequential decomposition with an example of a multiple access broadcast game. We prove the existence of CIB-PBE for a subclass of dynamic games.
We consider a multiple access communication system where multiple users share a common collision channel. Each user observes its local traffic and the feedback from the channel. At each time instant the feedback from the channel is one of three messages: no transmission, successful transmission, collision. The objective is to design a transmission protocol that coordinates the users' transmissions and achieves high throughput and low delay. We present a decentralized Common Information-Based Multiple Access (CIMA) protocol that has the following features: (i) it achieves the full throughput region of the collision channel; (ii) it results in a delay that is linear in the number of users, and is significantly lower than that of CSMA protocols; (iii) it avoids collisions without channel sensing.
In this paper an optimal relay selection algorithm with non-negligible probing time is proposed and analyzed for cooperative wireless networks. Relay selection has been introduced to solve the degraded bandwidth efficiency problem in cooperative communication. Yet complete information of relay channels often remain unavailable for complex networks which renders the optimal selection strategies impossible for transmission source without probing the relay channels. Particularly when the number of relay candidate is large, even though probing all relay channels guarantees the finding of the best relays at any time instant, the degradation of bandwidth efficiency due to non-negligible probing times, which was often neglected in past literature, is also significant. In this work, a stopping rule based relay selection strategy is determined for the source node to decide when to stop the probing process and choose one of the probed relays to cooperate with under wireless channels' stochastic uncertainties. This relay selection strategy is further shown to have a simple threshold structure. At the meantime, full diversity order and high bandwidth efficiency can be achieved simultaneously. Both analytical and simulation results are provided to verify the claims.
A discrete-time decentralized routing problem in a service system consisting of two service stations and two controllers is investigated. Each controller is affiliated with one station. Each station has an infinite size buffer. Exogenous customer arrivals at each station occur with rate $λ$. Service times at each station have rate $μ$. At any time, a controller can route one of the customers waiting in its own station to the other station. Each controller knows perfectly the queue length in its own station and observes the exogenous arrivals to its own station as well as the arrivals of customers sent from the other station. At the beginning, each controller has a probability mass function (PMF) on the number of customers in the other station. These PMFs are common knowledge between the two controllers. At each time a holding cost is incurred at each station due to the customers waiting at that station. The objective is to determine routing policies for the two controllers that minimize either the total expected holding cost over a finite horizon or the average cost per unit time over an infinite horizon. In this problem there is implicit communication between the two controllers; whenever a controller decides to send or not to send a customer from its own station to the other station it communicates information about its queue length to the other station. This implicit communication through control actions is referred to as signaling in decentralized control. Signaling results in complex communication and decision problems. In spite of the complexity of signaling involved, it is shown that an optimal signaling strategy is described by a threshold policy which depends on the common information between the two controllers; this threshold policy is explicitly determined.
We consider the channel sensing problem arising in opportunistic scheduling over fading channels, cognitive radio networks, and resource constrained jamming. The communication system consists of N channels. Each channel is modeled as a multi-state Markov chain (M.C.). At each time instant a user selects one channel to sense and uses it to transmit information. A reward depending on the state of the selected channel is obtained for each transmission. The objective is to design a channel sensing policy that maximizes the expected total reward collected over a finite or infinite horizon. This problem can be viewed as an instance of a restless bandit problem, for which the form of optimal policies is unknown in general. We discover sets of conditions sufficient to guarantee the optimality of a myopic sensing policy; we show that under one particular set of conditions the myopic policy coincides with the Gittins index rule.
In this paper, we use the 2-decent method to find a series of odd non-congruent numbers $\equiv1\pmod 8$ whose prime factors are $\equiv1\pmod4$ such that the congruent elliptic curves have second lowest Selmer groups, which includes Li and Tian's result (Li and Tian, 2000) as special cases.
We introduce and study the universal norm distribution in this paper, which generalizes the concepts of universal ordinary distribution and the universal Euler system. We study the Anderson type resolution of the universal norm distribution and then use this resolution to study the group cohomology of the universal norm distribution.
let U_z be the universal norm distribution and M a fixed power of prime p, by using the double complex method employed by Anderson, we study the universal Kolyvagin recursion occurred in the canonical basis in the zero-th cohomology group of U_z/M U_z. We furthermore show that the universal Kolyvagin recursion implies the Kolyvagin recursion in the theory of Euler systems(cf. Theorem 4.5.4 of K. Rubin's book Euler systems). One certainly hopes this could lead a new way to find new Euler systems.
In this note we give the Kolyvagin recursion in cyclotomic Euler systens a new and universal interpretation with the help of the double complex method introduced by Anderson and further developed by Das and Ouyang. Namely, we show that the recursion satisfied by Kolyvagin classes is the specialization of a universal recursion independent of the chosen field satisfied by universal Kolyvagin classes in the group cohomology of the universal ordinary distribution a la Kubert. Further, we show by a method involving a variant of the diagonal shift operation introduced by Das that certain group cohomology classes belonging (up to sign) to a basis previously constructed by Ouyang also satisfy the universal recursion.
We prove an abstract index formula about Sinnott's symbol between two different lattices. We also develop the theory of the universal distribution and predistribution in a double complex point of view. The theory of spectral sequence is used to interpret the index formula and to analyze the cohomology of the universal distribution. Combing these results, we successfully prove Sinnott's index formula about the Stickelberger ideal. In addition, the {1, -1}-cohomology groups of the universal distribution and the universal predistribution are obtained.
For any odd squarefree integer r, we get complete description of the G_r=Gal(Q(mu_r)/Q) group cohomology of the universal ordinary distribution U_r in this paper. Moreover, if M is a fixed integer which divides l-1 for all prime factors l of r, we study the cohomology group H^{*}(G_r, U_r/MU_r). In particular, we explain the mysterious construction of the elements kappa_{r'} for r'|r in Rubin's construction of Kolyvagin elements, which come exactly from a certain Z/M Z-basis of the cohomology group H^{0}(G_r, U_r/MU_r) through an evaluation map.