Search results for " Combinatoric"

One-dimensional nonlinear boundary value problems with variable exponent

2018

In this paper, a class of nonlinear differential boundary value problems with variable exponent is investigated. The existence of at least one non-zero solution is established, without assuming on the nonlinear term any condition either at zero or at infinity. The approach is developed within the framework of the Orlicz-Sobolev spaces with variable exponent and it is based on a local minimum theorem for differentiable functions.

Chromatic sums for colorings avoiding monochromatic subgraphs

2015

Abstract Given graphs G and H, a vertex coloring c : V ( G ) → N is an H-free coloring of G if no color class contains a subgraph isomorphic to H. The H-free chromatic number of G, χ ( H , G ) , is the minimum number of colors in an H-free coloring of G. The H-free chromatic sum of G , Σ ( H , G ) , is the minimum value achieved by summing the vertex colors of each H-free coloring of G. We provide a general bound for Σ ( H , G ) , discuss the computational complexity of finding this parameter for different choices of H, and prove an exact formulas for some graphs G. For every integer k and for every graph H, we construct families of graphs, G k with the property that k more colors than χ ( …

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

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 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.

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}$.

THE HOMOLOGY OF DIGRAPHS AS A GENERALIZATION OF HOCHSCHILD HOMOLOGY

2010

J. Przytycki has established a connection between the Hochschild homology of an algebra $A$ and the chromatic graph homology of a polygon graph with coefficients in $A$. In general the chromatic graph homology is not defined in the case where the coefficient ring is a non-commutative algebra. In this paper we define a new homology theory for directed graphs which takes coefficients in an arbitrary $A-A$ bimodule, for $A$ possibly non-commutative, which on polygons agrees with Hochschild homology through a range of dimensions.

Geometric optimal control of elliptic Keplerian orbits

2005

This article deals with the transfer of a satellite between Keplerian orbits. We study the controllability properties of the system and make a preliminary analysis of the time optimal control using the maximum principle. Second order sufficient conditions are also given. Finally, the time optimal trajectory to transfer the system from an initial low orbit with large eccentricity to a terminal geostationary orbit is obtained numerically.

Coding Partitions

2007

Motivated by the study of decipherability conditions for codes weaker than Unique Decipherability (UD), we introduce the notion of coding partition. Such a notion generalizes that of UD code and, for codes that are not UD, allows to recover the ''unique decipherability" at the level of the classes of the partition. By tacking into account the natural order between the partitions, we define the characteristic partition of a code X as the finest coding partition of X. This leads to introduce the canonical decomposition of a code in at most one unambiguous component and other (if any) totally ambiguous components. In the case the code is finite, we give an algorithm for computing its canonical…