Search results for "combinatoric"

Numerical study of blow-up in solutions to generalized Kadomtsev-Petviashvili equations

2013

We present a numerical study of solutions to the generalized Kadomtsev-Petviashvili equations with critical and supercritical nonlinearity for localized initial data with a single minimum and single maximum. In the cases with blow-up, we use a dynamic rescaling to identify the type of the singularity. We present a discussion of the observed blow-up scenarios.

Words

2015

Variances as order parameter and complexity measure for random Boolean networks

2005

Several order parameters have been considered to predict and characterize the transition between ordered and disordered phases in random Boolean networks, such as the Hamming distance between replicas or the stable core, which have been successfully used. In this work, we propose a natural and clear new order parameter: the temporal variance. We compute its value analytically and compare it with the results of numerical experiments. Finally, we propose a complexity measure based on the compromise between temporal and spatial variances. This new order parameter and its related complexity measure can be easily applied to other complex systems.

Localized potentials in electrical impedance tomography

2008

In this work we study localized electric potentials that have an arbitrarily high energy on some given subset of a domain and low energy on another. We show that such potentials exist for general L ∞ -conductivities in almost arbitrarily shaped subregions of a domain, as long as these regions are connected to the boundary and a unique continuation principle is satisfied. From this we deduce a simple, but new, theoretical identifiability result for the famous Calderon problem with partial data. We also show how to con- struct such potentials numerically and use a connection with the factorization method to derive a new non-iterative algorithm for the detection of inclusions in electrical imp…

The F-pure threshold of quasi-homogeneous polynomials

2018

Abstract Inspired by the work of Bhatt and Singh [3] we compute the F-pure threshold of quasi-homogeneous polynomials. We first consider the case of a curve given by a quasi-homogeneous polynomial f in three variables x , y , z of degree equal to the degree of xyz and then we proceed with the general case of a Calabi–Yau hypersurface, i.e. a hypersurface given by a quasi-homogeneous polynomial f in n + 1 variables x 0 , … , x n of degree equal to the degree of x 0 ⋯ x n .

k-Partite Graphs as Contexts

2018

International audience; In formal concept analysis, 2-dimensional formal contexts are bipar-tite graphs. In this work, we generalise the notions of context and concept to graphs that are not bipartite. We then study the complexity of the enumeration and identify the structure of the set of such concepts.

The pure descent statistic on permutations

2017

International audience; We introduce a new statistic based on permutation descents which has a distribution given by the Stirling numbers of the first kind, i.e., with the same distribution as for the number of cycles in permutations. We study this statistic on the sets of permutations avoiding one pattern of length three by giving bivariate generating functions. As a consequence, new classes of permutations enumerated by the Motzkin numbers are obtained. Finally, we deduce results about the popularity of the pure descents in all these restricted sets. (C) 2017 Elsevier B.V. All rights reserved.

Unfolding of saddle-nodes and their Dulac time

2016

Altres ajuts: UNAB10-4E-378, co-funded by ERDF "A way to build Europe" and by the French ANR-11-BS01-0009 STAAVF. In this paper we study unfoldings of saddle-nodes and their Dulac time. By unfolding a saddle-node, saddles and nodes appear. In the first result (Theorem A) we give a uniform asymptotic expansion of the trajectories arriving at the node. Uniformity is with respect to all parameters including the unfolding parameter bringing the node to a saddle-node and a parameter belonging to a space of functions. In the second part, we apply this first result for proving a regularity result (Theorem B) on the Dulac time (time of Dulac map) of an unfolding of a saddle-node. This result is a b…

IRREDUCIBLE COXETER GROUPS

2004

We prove that a non-spherical irreducible Coxeter group is (directly) indecomposable and that an indefinite irreducible Coxeter group is strongly indecomposable in the sense that all its finite index subgroups are (directly) indecomposable. Let W be a Coxeter group. Write W = WX1 × ⋯ × WXb × WZ3, where WX1, … , WXb are non-spherical irreducible Coxeter groups and WZ3 is a finite one. By a classical result, known as the Krull–Remak–Schmidt theorem, the group WZ3 has a decomposition WZ3 = H1 × ⋯ × Hq as a direct product of indecomposable groups, which is unique up to a central automorphism and a permutation of the factors. Now, W = WX1 × ⋯ × WXb × H1 × ⋯ × Hq is a decomposition of W as a dir…

Ping-pong configurations and circular orders on free groups

2017

We discuss actions of free groups on the circle with "ping-pong" dynamics; these are dynamics determined by a finite amount of combinatorial data, analogous to Schottky domains or Markov partitions. Using this, we show that the free group $F_n$ admits an isolated circular order if and only if n is even, in stark contrast with the case for linear orders. This answers a question from (Mann, Rivas, 2016). Inspired by work of Alvarez, Barrientos, Filimonov, Kleptsyn, Malicet, Menino and Triestino, we also exhibit examples of "exotic" isolated points in the space of all circular orders on $F_2$. Analogous results are obtained for linear orders on the groups $F_n \times \mathbb{Z}$.