Binary linear codes from vectorial boolean functions and their weight distribution

Binary linear codes with good parameters have important applications in secret sharing schemes, authentication codes, association schemes, and consumer electronics and communications. In this paper, we construct several classes of binary linear codes from vectorial Boolean functions and determine their parameters, by further studying a generic construction developed by Ding et al. recently. First, by employing perfect nonlinear functions and almost bent functions, we obtain several classes of six-weight linear codes which contain the all-one codeword, and determine their weight distribution. Second, we investigate a subcode of any linear code mentioned above and consider its parameters. When the vectorial Boolean function is a perfect nonlinear function or a Gold function in odd dimension, we can completely determine the weight distribution of this subcode. Besides, our linear codes have larger dimensions than the ones by Ding et al.’s generic construction.     

Additive cyclic codes over finite commutative chain rings

Additive cyclic codes over Galois rings were investigated in Cao et al. (2015). In this paper, we investigate the same problem but over a more general ring family, finite commutative chain rings. When we focus on non-Galois finite commutative chain rings, we observe two different kinds of additivity. One of them is a natural generalization of the study in Cao et al. (2015), whereas the other one has some unusual properties especially while constructing dual codes. We interpret the reasons of such properties and illustrate our results giving concrete examples.     

A one-dimensional version of the random interlacements

We base ourselves on the construction of the two-dimensional random interlacements (Comets et al., 2016) to define the one-dimensional version of the process. For this, we consider simple random walks conditioned on never hitting the origin. We compare this process to the conditional random walk on the ring graph. Our results are the convergence of the vacant set on the ring graph to the vacant set of one-dimensional random interlacements, a central limit theorem for the interlacements’ local time and the convergence in law of the local times of the conditional walk on the ring graph to the interlacements’ local times.     

Constructing rate 1/p systematic binary quasi-cyclic codes based on the matroid theory

In this paper, rate 1/p binary systematic quasi-cyclic (QC) codes are constructed based on Matroid Theory (MT). The relationship between the generator matrix and minimum distance d is derived through MT, which is benefit to find numbers of QC codes with large minimum distance by our Matroid search algorithm. More than seventy of QC codes that extend previously published results are presented. Among these codes, there are nine codes whose minimum distance is larger than those of the known codes found by Gulliver et al.     

Multilevel sequential Monte Carlo: Mean square error bounds under verifiable conditions

In this article, we consider the multilevel sequential Monte Carlo (MLSMC) method of Beskos et al. (Stoch. Proc. Appl. [to appear]). This is a technique designed to approximate expectations w.r.t. probability laws associated to a discretization. For instance, in the context of inverse problems, where one discretizes the solution of a partial differential equation. The MLSMC approach is especially useful when independent, coupled sampling is not possible. Beskos et al. show that for MLSMC the computational effort to achieve a given error, can be less than independent sampling. In this article we significantly weaken the assumptions of Beskos et al., extending the proofs to non-compact state-spaces. The assumptions are based upon multiplicative drift conditions as in Kontoyiannis and Meyn (Electron. J. Probab. 10 [2005]: 61–123). The assumptions are verified for an example.     

On self-dual cyclic codes over finite chain rings

In this paper, we give necessary and sufficient conditions for the existence of non-trivial cyclic self-dual codes over finite chain rings. We prove that there are no free cyclic self-dual codes over finite chain rings with odd characteristic. It is also proven that a self-dual code over a finite chain ring cannot be the lift of a binary cyclic self-dual code. The number of cyclic self-dual codes over chain rings is also investigated as an extension of the number of cyclic self-dual codes over finite fields given recently by Jia et al.     

Watching Systems in the King Grid

We consider the infinite King grid where we investigate properties of watching systems, an extension of the notion of identifying code recently introduced by Auger et al. (Discret. Appl. Math., 2011). The latter were extensively studied in the infinite King grid and we compare our results with those holding for (r, ≤?)-identifying codes. We prove that for r = 1 and ? = 1, the minimal density of an identifying code, known to be ${\frac{2}{9},}$ also holds for watching systems; however, when r is large we give an asymptotic equivalence of the optimal density of watching systems which is much better than identifying codes’. Turning to the case r = 1 and ? ≥ 1, we prove that in a certain sense when ? ≥ 6 the best watching systems in the infinite King grid are trivial, but that this is not the case when ? ≤ 4.     

Paley–Wiener properties for spaces of power series expansions

ABSTRACT

We extend Paley–Wiener results in the Bargmann setting deduced in Nabizadeh et al. [Paley-Wiener properties for spaces of entire functions, (preprint), arXiv:1806.10752.] to larger classes of power series expansions. At the same time, we deduce characterizations of all Pilipovi? spaces and their distributions (and not only of low orders as in Nabizadeh et al. [Paley-Wiener properties for spaces of entire functions, (preprint), arXiv:1806.10752.]).     

An Inexact Steepest Descent Method for Multicriteria Optimization on Riemannian Manifolds

In this paper, we present an inexact version of the steepest descent method with Armijo’s rule for multicriteria optimization in the Riemannian context given in Bento et al. (J. Optim. Theory Appl., 154: 88–107, 2012). Under mild assumptions on the multicriteria function, we prove that each accumulation point (if any) satisfies first-order necessary conditions for Pareto optimality. Moreover, assuming that the multicriteria function is quasi-convex and the Riemannian manifold has nonnegative curvature, we show full convergence of any sequence generated by the method to a Pareto critical point.     

Estimation de la fonction de survie sous biais de longueur pour des risques concurrents et proportionnels

Consider a population of individuals who experience two causes of death. We observe the ones alive at time t₀ and follow them until death. Given this length bias sample, we propose an estimator of the survival function of ‘initial survival times’ (i.e., for the entire population) under the assumption of proportional hazards for the two causes of death. The large sample behaviour of our estimator is also studied. To cite this article: J.-Y. Dauxois et al., C. R. Acad. Sci. Paris, Ser. I 337 (2003).     

A note on quadratic convergence of a smoothing Newton algorithm for the LCP

The linear complementarity problem (LCP) is to find ${(x,s)\in\mathfrak{R}^n\times\mathfrak{R}^n}$ such that (x, s) ≥ 0, s = Mx + q, x ^T s = 0 with ${M\in\mathfrak{R}^{n\times n}}$ and ${q\in\mathfrak{R}^n}$ . The smoothing Newton algorithm is one of the most efficient methods for solving the LCP. To the best of our knowledge, the best local convergence results of the smoothing Newton algorithm for the LCP up to now were obtained by Huang et al. (Math Program 99:423–441, 2004). In this note, by using a revised Chen–Harker–Kanzow–Smale smoothing function, we propose a variation of Huang–Qi–Sun’s algorithm and show that the algorithm possesses better local convergence properties than those given in Huang et al. (Math Program 99:423–441, 2004).     

Symmetric multiple chessboard complexes and a new theorem of Tverberg type

We prove a new theorem of Tverberg–van Kampen–Flores type, which confirms a conjecture of Blagojevi? et al. about the existence of ‘balanced Tverberg partitions’ (Conjecture 6.6 in [Tverberg plus constraints, Bull. London Math. Soc. 46:953–967 (2014]). The conditions in this theorem are somewhat weaker than in the original conjecture, and we show that the theorem is optimal in the sense that the new (weakened) condition is also necessary. Among the consequences is a positive answer (Theorem 7.2) to the ‘balanced case’ of the question asking whether each admissible r-tuple is Tverberg prescribable (Blagojevi? et al. 2014, Question 6.9).     

A class of authentication codes with secrecy

We study a class of authentication codes with secrecy. We determine the maximum success probabilities of the impersonation and the substitution attacks on these codes and the level of secrecy. Therefore we give an answer to an open problem stated in Ding et al. (J Pure Appl Algebra 196:149–168, 2005). Our proofs use the number of rational places of a certain class of algebraic function fields. We determine this number by extending the corresponding results of E. Çakçak and F. Özbudak (Finite Fields Appl 14(1):209–220, 2008). Our authentication codes use a map which is not perfect nonlinear in certain subcases. We give an extended and unified approach so that the parameters of our authentication codes are good also when the corresponding map is not perfect nonlinear.     

Cluster formation in opinion dynamics: a qualitative analysis

In this paper we formulate a discrete version of the bounded confidence model (Deffuant et al. in Adv Complex Syst 3:87–98, 2000; Weisbuch et al. in Complexity 7:55–63, 2002), which is representable as a family of ordinary differential equation systems. Then, we analytically study these systems. We establish the existence of equilibria which correspond to opinion profiles displaying a finite number of isolated clusters. We prove the asymptotic stability of some of these equilibria and show that they represent the asymptotic trend of the solutions of the systems under consideration. For a particular case, we also characterize the initial profiles that lead to different cluster configurations.     

Analysis of stochastic matching markets

Suppose that the agents of a matching market contact each other randomly and form new pairs if is in their interest. Does such a process always converge to a stable matching if one exists? If so, how quickly? Are some stable matchings more likely to be obtained by this process than others? In this paper we are going to provide answers to these and similar questions, posed by economists and computer scientists. In the first part of the paper we give an alternative proof for the theorems by Diamantoudi et al. and Inarra et al., which imply that the corresponding stochastic processes are absorbing Markov chains. The second part of the paper proposes new techniques to analyse the behaviour of matching markets. We introduce the Stable Marriage and Stable Roommates Automaton and show how the probabilistic model checking tool PRISM may be used to predict the outcomes of stochastic interactions between myopic agents. In particular, we demonstrate how one can calculate the probabilities of reaching different matchings in a decentralised market and determine the expected convergence time of the stochastic process concerned. We illustrate the usage of this technique by studying some well-known marriage and roommates instances and randomly generated instances.     

Regular simplices passing through holes

What is the smallest circular or square wall hole that a regular tetrahedron can pass? This problem was solved by Itoh et al. (Rend Circ Mat Palermo 2(77):349–354, 2006). Then, we settled the case of equilateral triangular hole in Bárány et al. (Tetrahedra passing through a triangular hole, 2009). Motivated by these results, we consider the corresponding problems in higher dimensions. Among other results, we determine the minimum (n ? 1)-dimensional ball hole that a unit regular n-simplex can pass. The diameter of the minimum hole goes to \({3\sqrt{2}/4}\) as n tends to infinity.     

The divisible sandpile with heavy-tailed variables

This work deals with the divisible sandpile model when an initial configuration sampled from a heavy-tailed distribution. Extending results of Levine et al. (2015) and Cipriani et al. (2016) we determine sufficient conditions for stabilization and non-stabilization on infinite graphs. We determine furthermore that the scaling limit of the odometer on the torus is an $\alpha$-stable random distribution.     

Subdifferential formulas for a class of non-convex infimal convolutions

In this paper, we provide a number of subdifferential formulas for a class of non-convex infimal convolutions in normed spaces. The formulas obtained unify several results on subdifferentials of the distance function and the minimal time function. In particular, we generalize the results obtained recently by Zhang et al.