Search results for "combinatoric"
showing 10 items of 1776 documents
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.
Dual Inequalities for Stabilized Column Generation Revisited
2014
Column generation (CG) models have several advantages over compact formulations: they provide better linear program bounds, may eliminate symmetry, and can hide nonlinearities in their subproblems. However, users also encounter drawbacks in the form of slow convergence, also known as the tailing-off effect, and the oscillation of the dual variables. Among different alternatives for stabilizing the CG process, Ben Amor et al. [Ben Amor H, Desrosiers J, Valério de Carvalho JM (2006) Dual-optimal inequalities for stabilized column generation. Oper. Res. 54(3):454–463] suggest the use of dual-optimal inequalities (DOIs) in the context of cutting stock and bin packing problems. We generalize th…
First Retrievals of ASCAT-IB VOD (Vegetation Optical Depth) at Global Scale
2021
Global and long-term vegetation optical depth (VOD) dataset are very useful to monitor the dynamics of the vegetation features, climate and environmental changes. In this study, the radar-based global ASCAT (Advanced SCATterometer) IB (INRAE-BORDEAUX) VOD was retrieved using a model which was recently calibrated over Africa. In order to assess the performance of IB VOD, the Saatchi biomass and three other VOD datasets (ASCAT V16, AMSR2 LPRM V5 and VODCA LPRM V6) derived from C-band observations were used in the comparison. The preliminary results show that IB VOD has a promising ability to predict biomass $(\mathrm{R}=0.74,\ \text{RMSE} =44.82\ \text{Mg}\ \text{ha}^{-1})$ , which is better …
On double Veronese embeddings in the Grassmannian G(1,N)
2004
We classify all the embeddings of P^n in a Grassmannian of lines G(1,N) such that the composition with Pl\"ucker is given by a linear system of quadrics of P^n.
Highly transitive actions of groups acting on trees
2015
We show that a group acting on a non-trivial tree with finite edge stabilizers and icc vertex stabilizers admits a faithful and highly transitive action on an infinite countable set. This result is actually true for infinite vertex stabilizers and some more general, finite of infinite, edge stabilizers that we call highly core-free. We study the notion of highly core-free subgroups and give some examples. In the case of amalgamated free products over highly core-free subgroups and HNN extensions with highly core-free base groups we obtain a genericity result for faithful and highly transitive actions. In particular, we recover the result of D. Kitroser stating that the fundamental group of …
Automorphisms and abstract commensurators of 2-dimensional Artin groups
2004
In this paper we consider the class of 2-dimensional Artin groups with connected, large type, triangle-free defining graphs (type CLTTF). We classify these groups up to isomorphism, and describe a generating set for the automorphism group of each such Artin group. In the case where the defining graph has no separating edge or vertex we show that the Artin group is not abstractly commensurable to any other CLTTF Artin group. If, moreover, the defining graph satisfies a further `vertex rigidity' condition, then the abstract commensurator group of the Artin group is isomorphic to its automorphism group and generated by inner automorphisms, graph automorphisms (induced from automorphisms of the…
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 χ ( …
Decremental 2- and 3-connectivity on planar graphs
1996
We study the problem of maintaining the 2-edge-, 2-vertex-, and 3-edge-connected components of a dynamic planar graph subject to edge deletions. The 2-edge-connected components can be maintained in a total ofO(n logn) time under any sequence of at mostO(n) deletions. This givesO(logn) amortized time per deletion. The 2-vertex- and 3-edge-connected components can be maintained in a total ofO(n log2n) time. This givesO(log2n) amortized time per deletion. The space required by all our data structures isO(n). All our time bounds improve previous bounds.
Unveiling the boost in the sandwich priming technique.
2021
The masked priming technique (which compares #####-house-HOUSE vs. #####-fight-HOUSE) is the gold-standard tool to examine the initial moments of word processing. Lupker and Davis showed that adding a pre-prime identical to the target produced greater priming effects in the sandwich technique (which compares #####-HOUSE-house-HOUSE vs #####-HOUSE-fight-HOUSE). While there is consensus that the sandwich technique magnifies the size of priming effects relative to the standard procedure, the mechanisms underlying this boost are not well understood (i.e., does it reflect quantitative or qualitative changes?). To fully characterise the sandwich technique, we compared the sandwich and standard t…
Optimal Mass Transport on Metric Graphs
2015
We study an optimal mass transport problem between two equal masses on a metric graph where the cost is given by the distance in the graph. To solve this problem we find a Kantorovich potential as the limit of $p$-Laplacian--type problems in the graph where at the vertices we impose zero total flux boundary conditions. In addition, the approximation procedure allows us to find a transport density that encodes how much mass has to be transported through a given point in the graph, and also provides a simple formula of convex optimization for the total cost.