scholarly journals Order Invariance on Decomposable Structures

2016 ◽  
Author(s):  
Michael Elberfeld ◽  
Marlin Frickenschmidt ◽  
Martin Grohe
Keyword(s):  
Decomposable Structures

ℵ0-categorical tree-decomposable structures

1992 ◽  
Vol 57 (2) ◽  
pp. 501-514
Author(s):  
A. H. Lachlan
Keyword(s):  
Permutation Group ◽  
Permutation Groups ◽  
Decomposable Structures

AbstractOur purpose in this note is to study countable ℵ0-categorical structures whose theories are tree-decomposable in the sense of Baldwin and Shelah. The permutation group corresponding to such a structure can be decomposed in a canonical manner into simpler permutation groups in the same class. As an application of the analysis we show that these structures are finitely homogeneous.

scholarly journals Logical analysis of data with decomposable structures

2002 ◽  
Vol 289 (2) ◽  
pp. 977-995 ◽  
Author(s):  
Hirotaka Ono ◽  
Kazuhisa Makino ◽  
Toshihide Ibaraki
Keyword(s):  
Logical Analysis ◽  
Logical Analysis Of Data ◽  
Decomposable Structures

scholarly journals Asymptotics of Decomposable Combinatorial Structures of Alg-Log Type With Positive Log Exponent

2010 ◽  
Vol DMTCS Proceedings vol. AM,... (Proceedings) ◽  
Author(s):  
Zhicheng Gao ◽  
David Laferrière ◽  
Daniel Panario
Keyword(s):  
Generating Function ◽  
Asymptotic Results ◽  
Combinatorial Structures ◽  
International Audience ◽  
Decomposable Structures

International audience We consider the multiset construction of decomposable structures with component generating function $C(z)$ of alg-log type, $\textit{i.e.}$, $C(z) = (1-z)^{-\alpha} (\log \frac{1}{ 1-z})^{\beta}$. We provide asymptotic results for the number of labeled objects of size $n$ in the case when $\alpha$ is positive and $\beta$ is positive and in the case $\alpha = 0$ and $\beta \geq 2$. The case $0<-\alpha <1$ and any $\beta$ and the case $\alpha > 0$ and $\beta = 0$ have been treated in previous papers. Our results extend previous work of Wright.

scholarly journals Special Issue “Nonsmooth Optimization in Honor of the 60th Birthday of Adil M. Bagirov”: Foreword by Guest Editors

Algorithms ◽  
2020 ◽  
Vol 13 (11) ◽  
pp. 282
Author(s):  
Napsu Karmitsa ◽  
Sona Taheri
Keyword(s):  
Nonsmooth Optimization ◽  
Unit Commitment ◽  
Multiple Instance Learning ◽  
Special Issue ◽  
Unit Commitment Problem ◽  
Nonsmooth Problems ◽  
Commitment Problem ◽  
Difference Of Convex ◽  
The Difference ◽  
Decomposable Structures

Nonsmooth optimization refers to the general problem of minimizing (or maximizing) functions that have discontinuous gradients. This Special Issue contains six research articles that collect together the most recent techniques and applications in the area of nonsmooth optimization. These include novel techniques utilizing some decomposable structures in nonsmooth problems—for instance, the difference-of-convex (DC) structure—and interesting important practical problems, like multiple instance learning, hydrothermal unit-commitment problem, and scheduling the disposal of nuclear waste.

scholarly journals The Size of the rth Smallest Component in Decomposable Structures with a Restricted Pattern

2007 ◽  
Vol DMTCS Proceedings vol. AH,... (Proceedings) ◽  
Author(s):  
Li Dong ◽  
Zhicheng Gao ◽  
Daniel Panario
Keyword(s):  
Asymptotic Expression ◽  
Combinatorial Structure ◽  
International Audience ◽  
Decomposable Structures ◽  
Restricted Pattern

International audience In our previous work [paper1], we derived an asymptotic expression for the probability that a random decomposable combinatorial structure of size n in the \exp -\log class has a given restricted pattern. In this paper, under similar conditions, we provide the probability that a random decomposable combinatorial structure has a given restricted pattern and the size of its rth smallest component is bigger than k, for r,k given integers. Our studies apply to labeled and unlabeled structures. We also give several concrete examples.

Sign in / Sign up

Export Citation Format

Share Document