应《网络安全法》要求，自2017年10月1日起，未进行实名认证将不得使用互联网跟帖服务。为保障您的帐号能够正常使用，请尽快对帐号进行手机号验证，感谢您的理解与支持！

24小时热门版块排行榜    

Znn3bq.jpeg
小木虫论坛-学术科研互动平台 » 专业学科区 » 数学 » 数学资源 » e-tex文件运行不了
91/1返回列表
查看: 1433  |  回复: 8
只看楼主 @他人 存档 新回复提醒 (忽略) 收藏    在APP中查看

84127546

金虫 (小有名气)

[求助] e-tex文件运行不了

我安装的是ctex, 现在有个etex文件，运行不了，怎么解决啊
回复此楼

» 猜你喜欢

» 本主题相关价值贴推荐，对您同样有帮助:
1楼 2011-06-20 15:42:52
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

soliton923

铁杆木虫 (职业作家)

数学村村长
你这个问题说得太大了 ，tex运行不出来是有很多问题的~~要想早点解决，你就把你那个运行的错误提示贴上来哦~~
赞一下 回复此楼
soliton;sato-theory;algebre-geometry；Random-Matrices-Theory; Riemann-Hilbert method
2楼2011-06-20 16:52:33
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

racoon01

专家顾问 (著名写手)

【答案】应助回帖

84127546(金币+1): 2011-06-20 17:16:15
引用回帖:
Originally posted by 84127546 at 2011-06-20 15:42:52:
我安装的是ctex, 现在有个etex文件，运行不了，怎么解决啊

最大的可能是你的电脑里缺少字体。还有就是\documentclass{article}之类的导言也是针对latex文件的，你自已做这些修改后再试试看。
赞一下 回复此楼
racoon
3楼2011-06-20 17:01:10
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

racoon01

专家顾问 (著名写手)

【答案】应助回帖

84127546(金币+2): 谢谢你，还是不行 2011-06-20 19:20:02
看到你悬赏的20个金币很诱人，就上网帮你查了查。请将本帖附件的rar文件解压缩，得到etex.sty文件。将此格式文件与你的etex源代码放在同一个文件夹，然后用latex编译，估计就OK了。
赞一下 回复此楼
racoon
4楼2011-06-20 17:54:38
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

racoon01

专家顾问 (著名写手)
如果方便的话，请把源文件贴上来，让我帮你试一下。
赞一下 回复此楼
racoon
5楼2011-06-20 20:14:13
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

84127546

金虫 (小有名气)
\magnification=1200 \baselineskip14pt\centerline{\bf Referee Report}
\vskip10pt\leftline{{\bf Title}: Short Cycle Covers of Cubic Graphs}
\leftline{{\bf Authors}: Daniel Kral et al.} \leftline{{\bf
Journal}: SIAM Journal on Discrete Mathematics} \leftline{{\bf File
Number}: SIDMA71746} \vskip10pt

The paper studies the short cycle covers of cubic graphs, and gives
a new upper bound on the total length of a cycle cover of cubic
graphs. For a general bridgeless graph with $m$ edges, $5m/3$ is the
best known upper bound on the total length of a cycle cover, which
was obtained by two different groups of people about 25 years ago.
Since then, no breakthrough was made. However, for a bridgeless
cubic graph, it was Jackson who first showed that the upper bound
can be improved to $64m/39$, and then to $44m/27$ by Fan. After
almost 15 years, the current paper improves the bound to $34m/21$.
This is interesting and significant, and should be published. The
only reservation I have is that the improvement is not obtained by a
new approach or new method. It is just a harder push, through the
same approach as that in ref.[5].

It is known that a bridgeless cubic graph $G$ has a 2-factor $F$
such that $G/F$, the graph obtained by contracting all the edges of
$F$, contains no 3-cuts, and so has a nowhere-zero 4-flow. Let
$cc(G)$ denote the minimum length of a cycle cover of $G$ and let
$d_\ell$ be the number of circuits of length $\ell$ in $F$. Suppose
that $G$ has $m$ edges. The following two inequalities are proved in
ref.[5].
$$cc(G)\leq {19\over 12} m+ {5\over 4} d_2+{5\over 8} d_5+
{3\over 4} d_6 - {1\over 8} d_7.$$
$$cc(G)\leq {5\over 3} m- d_2- {1\over 2} d_5 -d_6 -
{3\over 2} d_7.$$ Adding 5/4 times the second inequality to the
first one yields the upper bound $cc(G)\leq 44m/27$. In these two
inequalities, circuits of lengths more than 7 are not included. As
showed in ref.[5], circuits of length $4t$ $(t\geq2)$ are the main
"trouble". The only contribution of the current paper is the third
part of Lemma 12, which enable one to have an improvement on
covering circuits of length 8 and them improve the first inequality
above. I must say that I am not happy with the way used to overcome
the circuits of length 8 in the paper and have no patience to check
all the 16 cases in the third part of Lemma 12. If the editor can
get someone to check the correctness of the third part of Lemma 12,
and if the paper is revised according to the following comments,
then I think that it would be publishable.

\vskip15pt\noindent {\bf Comment 1}. In the introduction ( top of
page 2 ), it is said that Fulkerson Conjecture implies the Cycle
Double Cover Conjecture. To my knowledge, no one has proved this!
Fulkerson Conjecture gives a perfect matching 2-cover, which yields
a cycle 4-cover, not double cover!

\vskip8pt\noindent {\bf Comment 2}. Section 3 ( pages 4 to 8 )
should be simplified significantly. There is no need to use
"odd-connectedness". What you need here is just the property: the
vertex splitting creates no new 2-cuts, which has been studied well
in the literature.

\vskip8pt\noindent {\bf Comment 3}. There is no need for Lemma 9 (
Rainbow Lemma ). What you need here is the known result: every
bridgeless cubic graph $G$ has a 2-factor $F$ such that $G/F$ has a
nowhere-zero 4-flow. Manipulating this 4-flow is equivalent to
adjusting the 3-edge-coloring used in the proofs.

\vskip8pt\noindent {\bf Comment 4}. Page 13, line 13: notation used
$\to$ notations to be used

\vskip8pt\noindent {\bf Comment 5}. The whole section 5 should be
removed, which is entirely contained in the proof of the inequality
at the bottom of page 138 in ref.[5].

\vskip8pt\noindent {\bf Comment 6}. On pages 17-18, there is no need
to give a full proof of "the second cycle cover". Equation (9) can
be derived from the inequality in Lemma 3.4 of ref.[5] by using
$|V(G^*)|\leq \sum_{i=2}^{11}d_i+{1\over 12}(|F|-\sum_{i=2}^{11}
id_i)$. Note that because of the relaxation on $d_2$, an inequality
weaker than the one in Lemma 3.4 of ref.[5] is enough here, which
does not need the use of Lemma 3.3 in ref.[5].

\vskip15pt In summary, to obtain the result, the authors only need
to get equation (5), which is an improvement on the inequality at
the bottom of page 138 in ref.[5], by using the third part of Lemma
12. In this way, together with the above comments, the paper can be
shortened significantly. If the editor can have someone check the
correctness of the third part of Lemma 12, then such a revised
version should be acceptable.


\end
赞一下 回复此楼
6楼2011-06-21 09:45:07
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

racoon01

专家顾问 (著名写手)
引用回帖:
Originally posted by 84127546 at 2011-06-21 09:45:07:
\magnification=1200 \baselineskip14pt\centerline{\bf Referee Report}
\vskip10pt\leftline{{\bf Title}: Short Cycle Covers of Cubic Graphs}
\leftline{{\bf Authors}: Daniel Kral et al.} \leftline{{\ ...

给你修改了一下，用pdflatex编译通了，效果参看截图。修改后的源码见附件。
赞一下 回复此楼
racoon
7楼2011-06-21 10:53:36
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

84127546

金虫 (小有名气)
谢谢你
回复此楼
8楼2011-06-22 10:00:12
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

lianboyong

金虫 (小有名气)
怎么有这么好的人呀?
赞一下 回复此楼
9楼2011-09-30 21:30:09
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
相关版块跳转 我要订阅楼主 84127546 的主题更新
91/1返回列表
普通表情 龙 兔 虎 猫
最具人气热帖推荐 [查看全部] 作者 回/看 最后发表
[考研] 297，工科调剂? +4 河南农业大学-能 2026-04-14 4/200 2026-04-16 22:52 by wulijun2012
[考研] 22专硕求调剂 +10 haoyun上岸 2026-04-11 12/600 2026-04-16 22:21 by 猪会飞
[考研] 急需调剂 +7 绝不放弃22 2026-04-15 7/350 2026-04-16 22:09 by SUSE_CL
[考研] 290求调剂 +23 luoziheng 2026-04-10 25/1250 2026-04-16 17:25 by 冰雪遇见猪
[考研] 26药学专硕105500求调剂 +6 喽哈加油 2026-04-13 7/350 2026-04-16 14:31 by zhouxiaoyu
[考研] 271求调剂 +35 2261744733 2026-04-11 37/1850 2026-04-16 13:16 by jiahl2024
[考研] 297，工科调剂? +10 河南农业大学-能 2026-04-14 10/500 2026-04-15 21:50 by noqvsozv
[考研] 0854调剂 +13 长弓傲 2026-04-12 16/800 2026-04-15 13:45 by fenglj492
[考研] 245求调剂 +6 冰糖橘?汽水 2026-04-13 10/500 2026-04-14 10:49 by jyl0317
[考研] 求调剂 +12 璃茉一定上岸 2026-04-10 13/650 2026-04-14 00:08 by Equinoxhua
[考研] 293求调剂 +16 我爱高数高数爱� 2026-04-12 18/900 2026-04-13 21:47 by 学员JpLReM
[考研] 290求调剂 +18 柯淮然 2026-04-12 20/1000 2026-04-13 12:56 by cyh—315
[考研] 生物学调剂 +11 小冉要努力 2026-04-10 13/650 2026-04-13 11:46 by 电化学及催化
[考研] 343求调剂 +9 王国帅 2026-04-10 9/450 2026-04-11 20:31 by dongdian1
[考研] 283求调剂 086004考英二数二 +17 那个噜子 2026-04-10 18/900 2026-04-11 16:27 by 明月此时有
[考研] 求调剂 +3 胃痉挛累了 2026-04-11 5/250 2026-04-11 14:13 by luhong1990
[考研] 22408 327分求调剂 +4 韵风kon 2026-04-10 4/200 2026-04-11 09:51 by 猪会飞
[考研] 调剂 +19 小张ZA 2026-04-10 20/1000 2026-04-10 22:08 by 猪会飞
[考研] 265求调剂 +12 风说她早忘了 2026-04-10 13/650 2026-04-10 18:56 by chemisry
[考研] 一志愿京区985，085401，与本科专业一致，电子信息工程， +4 阳光开朗的男孩 2026-04-10 4/200 2026-04-10 18:27 by shenrf
信息提示
关闭
请填处理意见
关闭