16,214 research outputs found

    On the index-conjecture on the length four minimal zero-sum sequences

    Full text link
    Let GG be a finite cyclic group. Every sequence SS over GG can be written in the form S=(n1g)...(nlg)S=(n_1g)\cdot...\cdot(n_lg) where gGg\in G and n1,,nl[1,ord(g)]n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)], and the index \ind(S) of SS is defined to be the minimum of (n1++nl)/ord(g)(n_1+\cdots+n_l)/\hbox{\rm ord}(g) over all possible gGg\in G such that g=G\langle g\rangle=G. A conjecture says that if GG is finite such that gcd(G,6)=1\gcd(|G|,6)=1, then \ind(S)=1 for every minimal zero-sum sequence SS. In this paper, we prove that the conjecture holds if SS is reduced and at least one nin_i coprime to G|G|.Comment: International Journal of Number Theory (2013). arXiv admin note: text overlap with arXiv:1303.1682, arXiv:1303.1676 by other author

    Extremum Seeking-based Indirect Adaptive Control for Nonlinear Systems with State and Time-Dependent Uncertainties

    Full text link
    We study in this paper the problem of adaptive trajectory tracking for nonlinear systems affine in the control with bounded state-dependent and time-dependent uncertainties. We propose to use a modular approach, in the sense that we first design a robust nonlinear state feedback which renders the closed loop input to state stable(ISS) between an estimation error of the uncertain parameters and an output tracking error. Next, we complement this robust ISS controller with a model-free multiparametric extremum seeking (MES) algorithm to estimate the model uncertainties. The combination of the ISS feedback and the MES algorithm gives an indirect adaptive controller. We show the efficiency of this approach on a two-link robot manipulator example

    On the index-conjecture of length four minimal zero-sum sequences II

    Full text link
    Let GG be a finite cyclic group. Every sequence SS over GG can be written in the form S=(n1g)...(nlg)S=(n_1g)\cdot...\cdot(n_lg) where gGg\in G and n1,,nl[1,ord(g)]n_1,\cdots,n_l\in[1,{\hbox{\rm ord}}(g)], and the index \ind S of SS is defined to be the minimum of (n1++nl)/ord(g)(n_1+\cdots+n_l)/\hbox{\rm ord}(g) over all possible gGg\in G such that g=G\langle g\rangle=G. A conjecture says that if GG is finite such that gcd(G,6)=1\gcd(|G|,6)=1, then \ind(S)=1 for every minimal zero-sum sequence SS. In this paper, we prove that the conjecture holds if SS is reduced and the (A1) condition is satisfied(see [19]).Comment: arXiv admin note: text overlap with arXiv:1303.1682, arXiv:1303.1676 by other author

    Vertex Operator Representations of Type Cl(1)C_l^{(1)} and Product-Sum Identities

    Full text link
    The purposes of this work are to construct a class of homogeneous vertex representations of Cl(1) (l2)C_l^{(1)} \ (l\geq2), and to derive a series of product-sum identities. These identities have fine interpretation in number theory

    Optical stimulated slowing of polar heavy-atom molecules with a constant beat phase

    Full text link
    Polar heavy-atom molecules have been well recognized as promising candidates for precision measurements and tests of fundamental physics. A much slower molecular beam to increase the interaction time should lead to a more sensitive measurement. Here we theoretically demonstrate the possibility of the stimulated longitudinal slowing of heavy-atom molecules by the coherent optical bichromatic force with a constant beat phase. Taking the YbF meolecule as an example, we show that a rapid and short-distance deceleration of heavy molecules by a phase-compensation method is feasible with moderate conditions. A molecular beam of YbF with a forward velocity of 120 m/s can be decelerated below 10 m/s within a distance of 3.5 cm and with a laser irradiance for each traveling wave of 107.2 W/cm2^2. We also give a simple approach to estimate the performance of the BCF on some other heavy molecules, which is helpful for making a rapid evaluation on the feasibility of the stimulated slowing experiment. Our proposed slowing method could be a promising approach to break through the space constraint or the limited capture efficiency of molecules loadable into a MOT in traditional deceleration schemes, opening the possibility for a significant improvement of the precision measurement sensitivity

    Constraints on Cosmic Distance Duality Relation from Cosmological Observations

    Full text link
    In this paper, we use the model dependent method to revisit the constraint on the well-known cosmic distance duality relation (CDDR). By using the latest SNIa samples, such as Union2.1, JLA and SNLS, we find that the SNIa data alone can not constrain the cosmic opacity parameter ε\varepsilon, which denotes the deviation from the CDDR, dL=dA(1+z)2+εd_{\rm L} = d_{\rm A}(1+z)^{2+\varepsilon}, very well. The constraining power on ε\varepsilon from the luminosity distance indicator provided by SNIa and GRB is hardly to be improved at present. When we include other cosmological observations, such as the measurements of Hubble parameter, the baryon acoustic oscillations and the distance information from cosmic microwave background, we obtain the tightest constraint on the cosmic opacity parameter ε\varepsilon, namely the 68\% C.L. limit: ε=0.023±0.018\varepsilon=0.023\pm0.018. Furthermore, we also consider the evolution of ε\varepsilon as a function of zz using two methods, the parametrization and the principle component analysis, and do not find the evidence for the deviation from zero. Finally, we simulate the future SNIa and Hubble measurements and find the mock data could give very tight constraint on the cosmic opacity ε\varepsilon and verify the CDDR at high significance.Comment: 9 pages, 5 figures, 2 tables, Accepted for publication in Physics of Dark Univers

    Complex Balanced Spaces

    Full text link
    In this paper, the concept of balanced manifolds is generalized to reduced complex spaces: the class B and balanced spaces. Compared with the case of Kahlerian, the class B is similar to the Fujiki class C and the balanced space is similar to the Kahler space. Some properties about these complex spaces are obtained, and the relations between the balanced spaces and the class B are studied.Comment: 15 pages. arXiv admin note: text overlap with arXiv:1610.0715

    A Passivity-Based Design for Stability and Robustness in Event-Triggered Networked Control Systems with Communication Delays, Signal Quantizations and Packet Dropouts

    Full text link
    In this report, we introduce a comprehensive design framework for Event-Triggered Networked Control Systems based on the passivity-based concept of Input Feed-Forward Output Feedback Passive (IF-OFP) systems. Our approach is comprehensive in the sense that we show finite-gain L2L_2-stability and robustness for the networked control system by considering the effects of time-varying or constant network induced delays, signal quantizations, and data losses in communication links from the plant to controller and the controller to plant. Our design is based on the need for a more efficient utilization of band-limited shared communication networks which is a necessity for the design of Large-Scale Cyber-Physical systems. To achieve this, we introduce simple triggering conditions that do not require the exact knowledge of the sub-systems and are located on both sides of the communication network: the plant's output and the controller's output. This specifically leads to a great decrease in the communication rate between the controller and plant. Additionally, we show lower-bounds on inter-event time intervals for the triggering conditions and show the design's robustness against external noise and disturbance. We illustrate the relationship amongst stability, robustness and passivity levels for the plant and controller. We analyze our design's robustness against packet dropouts and loss of communication. Our results are design-oriented in the sense that based on our proposed framework, the designer can easily observe the trade-offs amongst different components of the networked control system, time-varying delays, effects of signal quantizations and triggering conditions, stability, robustness and performance of networked control system and make design decisions accordingly

    Omnidirectional Precoding and Combining Based Synchronization for Millimeter Wave Massive MIMO Systems

    Full text link
    In this paper, we design the precoding matrices at the base station side and the combining matrices at the user terminal side for initial downlink synchronization in millimeter wave massive multiple-input multiple-output systems. First, we demonstrate two basic requirements for the precoding and combining matrices, including that all the entries therein should have constant amplitude under the implementation architecture constraint, and the average transmission power over the total K time slots taking for synchronization should be constant for any spatial direction. Then, we derive the optimal synchronization detector based on generalized likelihood ratio test. By utilizing this detector, we analyze the effect of the precoding and combining matrices to the missed detection probability and the false alarm probability, respectively, and present the corresponding conditions that should be satisfied. It is shown that, both of the precoding and combining matrices should guarantee the perfect omnidirectional coverage at each time slot, i.e., the average transmission power at each time slot is constant for any spatial direction, which is more strict than the second basic requirement mentioned above. We also show that such omnidirectional precoding matrices and omnidirectional combining matrices exist only when both of the number of transmit streams and the number of receive streams are equal to or greater than two. In this case, we propose to utilize Golay complementary pairs and Golay-Hadamard matrices to design the precoding and combining matrices. Simulation results verify the effectiveness of the propose approach

    QSR-Dissipativity and Passivity Analysis of Event-Triggered Networked Control Cyber-Physical Systems

    Full text link
    Input feed-forward output feedback passive (IF-OFP) systems define a great number of dynamical systems. In this report, we show that dissipativity and passivity-based control combined with event-triggered networked control systems (NCS) provide a powerful platform for the design of cyber-physical systems (CPS). We propose QSR-dissipativity, passivity and L2 stability conditions for an event-triggered networked control system in three cases where: (i) an input-output event-triggering sampler condition is located on the plant's output side, (ii) an input-output event-triggering sampler condition is located on controller's output side, (iii) input-output event-triggering sampler conditions are located on the outputs of both the plant and controller. We will show that this leads to a large decrease in communicational load amongst sub-units in networked control structures. We show that passivity and stability conditions depend on passivity levels for the plant and controller. Our results also illustrate the trade-off among passivity levels, stability, and system's dependence on the rate of communication between the plant and controller.Comment: 46 pages, 27 figure
    corecore