Results 11 to 20 of about 4,935,503 (221)

Supersaturation and stability for forbidden subposet problems [PDF]

open access: yes, 2015
We address a supersaturation problem in the context of forbidden subposets. A family $\mathcal{F}$ of sets is said to contain the poset $P$ if there is an injection $i:P \rightarrow \mathcal{F}$ such that $p \le_P q$ implies $i(p) \subset i (q)$.
Patkos, Balazs
core   +5 more sources

Hardness Amplification of Optimization Problems [PDF]

open access: yes, 2019
In this paper, we prove a general hardness amplification scheme for optimization problems based on the technique of direct products. We say that an optimization problem ?
Goldenberg, Elazar, Karthik C. S.,
core   +2 more sources

Search Problems in Vector Spaces [PDF]

open access: yes, 2014
We consider the following $q$-analog of the basic combinatorial search problem: let $q$ be a prime power and $\GF(q)$ the finite field of $q$ elements.
Héger, Tamás   +2 more
core   +2 more sources

Two problems related to the Smarandache function [PDF]

open access: yes, 2008
The main purpose of this paper is to study the solvability of some equations involving the pseudo Smarandache function Z(n) and the Smarandache reciprocal function Sc(n), and propose some interesting ...
Li, Ling, Wenpeng, Zhang
core   +1 more source

More eigenvalue problems of Nordhaus-Gaddum type [PDF]

open access: yes, 2014
Let $G$ be a graph of order $n$ and let $\mu_{1}\left(G\right) \geq \cdots\geq\mu_{n}\left(G\right) $ be the eigenvalues of its adjacency matrix. This note studies eigenvalue problems of Nordhaus-Gaddum type.
Nikiforov, Vladimir, Yuan, Xiying
core   +1 more source

Steiner Forest Orientation Problems [PDF]

open access: yes, 2011
We consider connectivity problems with orientation constraints. Given a directed graph $D$ and a collection of ordered node pairs $P$ let $P[D]=\{(u,v) \in P: D {contains a} uv{-path}}$.
Cygan, Marek, Kortsarz, Guy, Nutov, Zeev
core   +6 more sources

Worldlines on Orbifolds and the Fayet-Iliopoulos Term

open access: yes, 2004
We adapt ``string-inspired'' worldline techniques to one-loop calculations on orbifolds, in particular on the $S^1/Z_2$ orbifold. Our method also allows for the treatment of brane-localized terms, or bulk-brane couplings.
Arkani-Hamed   +15 more
core   +2 more sources

General Stieltjes moment problems for rapidly decreasing smooth functions [PDF]

open access: yes, 2017
We give (necessary and sufficient) conditions over a sequence $\left\{ f_{n}\right\} _{n=0}^{\infty}$ of functions under which every generalized Stieltjes moment problem \[ \int_{0}^{\infty} f_{n}(x)\phi(x)\mathrm{d} x=a_{n}, \ \ \ n\in\mathbb{N}, \] has
Estrada, Ricardo, Vindas, Jasson
core   +2 more sources

N-particle N-level singlet states: Some properties and applications

open access: yes, 2002
Three apparently unrelated problems which have no solution using classical tools are described: the "N-strangers," "secret sharing," and "liar detection" problems. A solution for each of them is proposed.
Adán Cabello   +7 more
core   +1 more source

Extremal problems for the p-spectral radius of graphs [PDF]

open access: yes, 2014
The $p$-spectral radius of a graph $G\ $of order $n$ is defined for any real number $p\geq1$ as \[ \lambda^{\left( p\right) }\left( G\right) =\max\left\{ 2\sum_{\{i,j\}\in E\left( G\right) \ }x_{i}x_{j}:x_{1},\ldots,x_{n}\in\mathbb{R}\text{ and }\left ...
Kang, Liying, Nikiforov, Vladimir
core   +1 more source

Home - About - Disclaimer - Privacy